./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX --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 e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:57:04,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:57:04,357 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:57:04,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:57:04,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:57:04,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:57:04,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:57:04,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:57:04,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:57:04,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:57:04,391 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:57:04,392 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:57:04,393 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:57:04,393 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:57:04,394 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:57:04,394 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:57:04,395 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:57:04,395 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:57:04,396 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:57:04,396 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:57:04,397 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:57:04,398 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:57:04,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:57:04,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:57:04,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:57:04,400 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:57:04,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:57:04,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:57:04,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:57:04,401 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:57:04,402 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:57:04,402 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:57:04,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:57:04,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:57:04,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:57:04,404 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:57:04,404 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:57:04,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:57:04,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:57:04,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:57:04,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:57:04,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:57:04,405 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:57:04,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:57:04,406 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:57:04,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:57:04,406 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_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/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_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX 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 -> e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f [2023-11-12 00:57:04,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:57:04,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:57:04,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:57:04,698 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:57:04,698 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:57:04,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-ext-properties/list-ext_1.i [2023-11-12 00:57:07,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:57:08,252 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:57:08,253 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/sv-benchmarks/c/list-ext-properties/list-ext_1.i [2023-11-12 00:57:08,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/data/af31132c7/5801d929c68f4fe2bf0e0a5f4f7c3a46/FLAGadb646f1e [2023-11-12 00:57:08,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/data/af31132c7/5801d929c68f4fe2bf0e0a5f4f7c3a46 [2023-11-12 00:57:08,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:57:08,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:57:08,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:57:08,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:57:08,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:57:08,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4141d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08, skipping insertion in model container [2023-11-12 00:57:08,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,351 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:57:08,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:57:08,759 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:57:08,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:57:08,855 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:57:08,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08 WrapperNode [2023-11-12 00:57:08,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:57:08,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:57:08,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:57:08,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:57:08,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,910 INFO L138 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 132 [2023-11-12 00:57:08,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:57:08,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:57:08,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:57:08,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:57:08,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:57:08,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:57:08,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:57:08,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:57:08,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (1/1) ... [2023-11-12 00:57:08,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:57:08,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:08,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:57:09,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:57:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 00:57:09,025 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 00:57:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:57:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:57:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:57:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:57:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:57:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:57:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:57:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:57:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:57:09,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:57:09,148 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:57:09,154 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:57:09,195 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 00:57:09,609 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:57:09,705 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:57:09,705 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:57:09,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:09 BoogieIcfgContainer [2023-11-12 00:57:09,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:57:09,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:57:09,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:57:09,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:57:09,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:08" (1/3) ... [2023-11-12 00:57:09,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60263b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:09, skipping insertion in model container [2023-11-12 00:57:09,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:08" (2/3) ... [2023-11-12 00:57:09,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60263b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:09, skipping insertion in model container [2023-11-12 00:57:09,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:09" (3/3) ... [2023-11-12 00:57:09,724 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_1.i [2023-11-12 00:57:09,746 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:57:09,746 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-11-12 00:57:09,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:57:09,817 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;@7982f305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:57:09,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-12 00:57:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 41 states have (on average 2.292682926829268) internal successors, (94), 81 states have internal predecessors, (94), 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-11-12 00:57:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:57:09,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:09,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:57:09,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:09,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:09,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1992725426, now seen corresponding path program 1 times [2023-11-12 00:57:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641926628] [2023-11-12 00:57:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:10,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641926628] [2023-11-12 00:57:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641926628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:57:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781000923] [2023-11-12 00:57:10,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:10,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:57:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:57:10,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:57:10,118 INFO L87 Difference]: Start difference. First operand has 83 states, 41 states have (on average 2.292682926829268) internal successors, (94), 81 states have internal predecessors, (94), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:10,191 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-11-12 00:57:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:57:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:57:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:10,205 INFO L225 Difference]: With dead ends: 82 [2023-11-12 00:57:10,206 INFO L226 Difference]: Without dead ends: 76 [2023-11-12 00:57:10,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:57:10,215 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:10,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:57:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-12 00:57:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-12 00:57:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-11-12 00:57:10,265 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 6 [2023-11-12 00:57:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:10,266 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-11-12 00:57:10,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-11-12 00:57:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:57:10,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:10,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:57:10,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:57:10,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:10,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1992577303, now seen corresponding path program 1 times [2023-11-12 00:57:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:10,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541197752] [2023-11-12 00:57:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:10,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:10,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541197752] [2023-11-12 00:57:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541197752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:10,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:57:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300724971] [2023-11-12 00:57:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:10,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:57:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:10,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:57:10,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:57:10,460 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:10,670 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2023-11-12 00:57:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:57:10,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:57:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:10,672 INFO L225 Difference]: With dead ends: 94 [2023-11-12 00:57:10,672 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 00:57:10,673 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-11-12 00:57:10,675 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 134 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:10,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 32 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 00:57:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-11-12 00:57:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.8125) internal successors, (87), 74 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-11-12 00:57:10,686 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 6 [2023-11-12 00:57:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:10,686 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-11-12 00:57:10,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-11-12 00:57:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:57:10,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:10,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:57:10,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:57:10,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:10,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1992577302, now seen corresponding path program 1 times [2023-11-12 00:57:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:10,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912087227] [2023-11-12 00:57:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:10,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912087227] [2023-11-12 00:57:10,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912087227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:10,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:10,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:57:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959254964] [2023-11-12 00:57:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:10,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:57:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:10,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:57:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:57:10,941 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:11,173 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2023-11-12 00:57:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:57:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:57:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:11,189 INFO L225 Difference]: With dead ends: 147 [2023-11-12 00:57:11,189 INFO L226 Difference]: Without dead ends: 147 [2023-11-12 00:57:11,190 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-11-12 00:57:11,196 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 111 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:11,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 78 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-12 00:57:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2023-11-12 00:57:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2023-11-12 00:57:11,212 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 6 [2023-11-12 00:57:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:11,213 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2023-11-12 00:57:11,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2023-11-12 00:57:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:57:11,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:11,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:11,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:57:11,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:11,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash -718284423, now seen corresponding path program 1 times [2023-11-12 00:57:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:11,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073295361] [2023-11-12 00:57:11,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:11,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:11,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073295361] [2023-11-12 00:57:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073295361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:11,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:11,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:57:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732778399] [2023-11-12 00:57:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:11,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:57:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:11,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:57:11,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:57:11,467 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:11,689 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-11-12 00:57:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:57:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:57:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:11,691 INFO L225 Difference]: With dead ends: 120 [2023-11-12 00:57:11,691 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 00:57:11,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:57:11,695 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 97 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:11,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 102 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 00:57:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2023-11-12 00:57:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 98 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2023-11-12 00:57:11,705 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 12 [2023-11-12 00:57:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:11,706 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2023-11-12 00:57:11,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2023-11-12 00:57:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:57:11,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:11,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:11,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:57:11,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:11,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -718284422, now seen corresponding path program 1 times [2023-11-12 00:57:11,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:11,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192045112] [2023-11-12 00:57:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:11,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192045112] [2023-11-12 00:57:11,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192045112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:57:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804839277] [2023-11-12 00:57:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:11,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:57:11,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:57:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:57:11,959 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:12,219 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2023-11-12 00:57:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:57:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:57:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:12,220 INFO L225 Difference]: With dead ends: 112 [2023-11-12 00:57:12,221 INFO L226 Difference]: Without dead ends: 112 [2023-11-12 00:57:12,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:57:12,222 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 54 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:12,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 146 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-12 00:57:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2023-11-12 00:57:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 82 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2023-11-12 00:57:12,230 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 12 [2023-11-12 00:57:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:12,230 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2023-11-12 00:57:12,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2023-11-12 00:57:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:57:12,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:12,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:12,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:57:12,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:12,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1704337968, now seen corresponding path program 1 times [2023-11-12 00:57:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819409192] [2023-11-12 00:57:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:12,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:12,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819409192] [2023-11-12 00:57:12,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819409192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:12,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:12,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:57:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546360296] [2023-11-12 00:57:12,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:57:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:12,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:57:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:57:12,490 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:12,741 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2023-11-12 00:57:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:57:12,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 00:57:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:12,743 INFO L225 Difference]: With dead ends: 136 [2023-11-12 00:57:12,743 INFO L226 Difference]: Without dead ends: 136 [2023-11-12 00:57:12,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:57:12,744 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 199 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:12,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 93 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-12 00:57:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 78. [2023-11-12 00:57:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.532258064516129) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-11-12 00:57:12,751 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 13 [2023-11-12 00:57:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:12,751 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-11-12 00:57:12,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-11-12 00:57:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:57:12,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:12,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:12,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:57:12,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:12,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:12,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1490657010, now seen corresponding path program 1 times [2023-11-12 00:57:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956042389] [2023-11-12 00:57:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:12,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956042389] [2023-11-12 00:57:12,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956042389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:12,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:57:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723222127] [2023-11-12 00:57:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:12,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:57:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:57:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:57:12,998 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:13,295 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2023-11-12 00:57:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:57:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:57:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:13,296 INFO L225 Difference]: With dead ends: 126 [2023-11-12 00:57:13,297 INFO L226 Difference]: Without dead ends: 126 [2023-11-12 00:57:13,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:57:13,298 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 159 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:13,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 106 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-12 00:57:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 73. [2023-11-12 00:57:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 72 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2023-11-12 00:57:13,303 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 15 [2023-11-12 00:57:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:13,304 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2023-11-12 00:57:13,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2023-11-12 00:57:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:57:13,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:13,305 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:13,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:57:13,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:13,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:13,322 INFO L85 PathProgramCache]: Analyzing trace with hash 263908707, now seen corresponding path program 1 times [2023-11-12 00:57:13,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:13,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25052276] [2023-11-12 00:57:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:13,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:13,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:13,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25052276] [2023-11-12 00:57:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25052276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096754019] [2023-11-12 00:57:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:13,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:13,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:13,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:13,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:57:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:13,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:57:13,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:13,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:13,939 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:13,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-11-12 00:57:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:14,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096754019] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:14,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [278069719] [2023-11-12 00:57:14,097 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:57:14,097 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:14,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:14,107 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:14,108 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:16,114 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:17,154 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1654#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 3) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~y~0#1_28| Int) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_101| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_84| Int)) (and (= (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| (select (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84|))) |v_#memory_$Pointer$.base_54|) (or (and (= |v_ULTIMATE.start_main_~p~0#1.offset_84| 0) (= |v_ULTIMATE.start_main_~y~0#1_28| 0)) (= |ULTIMATE.start_main_~t~0#1.offset| 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 8) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_101|)) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_101|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) 0))) (= (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| (select (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84|))) |v_#memory_$Pointer$.offset_54|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_84|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) 0))) (= |#memory_int| (store |v_#memory_int_43| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (store (select |v_#memory_int_43| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| 3) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4))))) (<= 0 |v_ULTIMATE.start_main_~y~0#1_28|))) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))' at error location [2023-11-12 00:57:17,154 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:17,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-11-12 00:57:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368269202] [2023-11-12 00:57:17,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:17,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:57:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:57:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=589, Unknown=1, NotChecked=0, Total=756 [2023-11-12 00:57:17,157 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:17,513 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-11-12 00:57:17,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:57:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-12 00:57:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:17,515 INFO L225 Difference]: With dead ends: 103 [2023-11-12 00:57:17,515 INFO L226 Difference]: Without dead ends: 103 [2023-11-12 00:57:17,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=721, Unknown=1, NotChecked=0, Total=930 [2023-11-12 00:57:17,516 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 319 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:17,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 129 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:57:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-12 00:57:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2023-11-12 00:57:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.4) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-12 00:57:17,522 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2023-11-12 00:57:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:17,522 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-12 00:57:17,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-12 00:57:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:57:17,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:17,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:17,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:17,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:57:17,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:17,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1993991201, now seen corresponding path program 1 times [2023-11-12 00:57:17,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428935483] [2023-11-12 00:57:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:18,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:18,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428935483] [2023-11-12 00:57:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428935483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:18,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:57:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919918014] [2023-11-12 00:57:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:18,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:57:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:18,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:57:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:57:18,119 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:18,430 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2023-11-12 00:57:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:57:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-12 00:57:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:18,431 INFO L225 Difference]: With dead ends: 113 [2023-11-12 00:57:18,431 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 00:57:18,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:57:18,432 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 162 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:18,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 106 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 00:57:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2023-11-12 00:57:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-12 00:57:18,437 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 17 [2023-11-12 00:57:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:18,437 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-12 00:57:18,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-12 00:57:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:57:18,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:18,438 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:18,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:57:18,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:18,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1980779038, now seen corresponding path program 1 times [2023-11-12 00:57:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:18,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529921417] [2023-11-12 00:57:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:18,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529921417] [2023-11-12 00:57:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529921417] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972783454] [2023-11-12 00:57:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:18,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:19,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:57:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:19,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-12 00:57:19,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:19,168 INFO L351 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-11-12 00:57:19,179 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:57:19,180 INFO L351 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-11-12 00:57:19,230 INFO L351 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-11-12 00:57:19,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:57:19,272 INFO L351 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-11-12 00:57:19,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:19,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:19,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:19,527 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:19,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-12 00:57:19,545 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-12 00:57:19,545 INFO L351 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 33 treesize of output 32 [2023-11-12 00:57:19,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 00:57:19,567 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:57:19,568 INFO L351 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-11-12 00:57:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972783454] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2022162648] [2023-11-12 00:57:19,634 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:57:19,634 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:19,635 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:19,635 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:19,635 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:21,262 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:22,838 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2187#(and (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_70| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_94| Int) (|v_ULTIMATE.start_main_~p~0#1.base_113| Int) (|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_63| |v_ULTIMATE.start_main_~p~0#1.base_113| (store (store (select |v_#memory_int_63| |v_ULTIMATE.start_main_~p~0#1.base_113|) |v_ULTIMATE.start_main_~p~0#1.offset_94| 3) (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_113|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4))))) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_113|) 1) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 8) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_113|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_113| (store (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_113|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4) 0))) (= (store |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_main_~p~0#1.base_113| (store (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_main_~p~0#1.base_113|) |v_ULTIMATE.start_main_~p~0#1.offset_94| (select (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_113|) |v_ULTIMATE.start_main_~p~0#1.offset_94|))) |v_#memory_$Pointer$.offset_70|) (= (store |v_#memory_$Pointer$.base_70| |v_ULTIMATE.start_main_~p~0#1.base_113| (store (select |v_#memory_$Pointer$.base_70| |v_ULTIMATE.start_main_~p~0#1.base_113|) |v_ULTIMATE.start_main_~p~0#1.offset_94| (select (select |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_113|) |v_ULTIMATE.start_main_~p~0#1.offset_94|))) |v_#memory_$Pointer$.base_71|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_113| (store (select |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_113|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4) 0))) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_94|))) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|)) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_117| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_98| Int)) (and (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_117|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_98| 4)) |ULTIMATE.start_main_~p~0#1.base|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_98|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_98| 8) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_117|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_117|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_98| 4)) |ULTIMATE.start_main_~p~0#1.offset|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_117|) 1)))) (= |ULTIMATE.start_main_~y~0#1| 0) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)))' at error location [2023-11-12 00:57:22,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:22,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:22,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-11-12 00:57:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801614784] [2023-11-12 00:57:22,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:22,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 00:57:22,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 00:57:22,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1115, Unknown=13, NotChecked=0, Total=1260 [2023-11-12 00:57:22,841 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:24,535 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2023-11-12 00:57:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-12 00:57:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-12 00:57:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:24,543 INFO L225 Difference]: With dead ends: 187 [2023-11-12 00:57:24,544 INFO L226 Difference]: Without dead ends: 187 [2023-11-12 00:57:24,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=436, Invalid=2743, Unknown=13, NotChecked=0, Total=3192 [2023-11-12 00:57:24,546 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 422 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:24,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 354 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 00:57:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-12 00:57:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 105. [2023-11-12 00:57:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 104 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2023-11-12 00:57:24,553 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 19 [2023-11-12 00:57:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:24,554 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2023-11-12 00:57:24,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2023-11-12 00:57:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:57:24,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:24,555 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:24,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:24,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:57:24,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:24,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 335262017, now seen corresponding path program 1 times [2023-11-12 00:57:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338041809] [2023-11-12 00:57:24,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:24,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:25,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338041809] [2023-11-12 00:57:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338041809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437561417] [2023-11-12 00:57:25,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:25,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:25,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:25,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:25,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:57:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:25,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 00:57:25,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:25,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-12 00:57:25,613 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:57:25,613 INFO L351 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-11-12 00:57:25,691 INFO L351 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 19 treesize of output 1 [2023-11-12 00:57:25,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-12 00:57:25,924 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-12 00:57:25,925 INFO L351 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 39 treesize of output 30 [2023-11-12 00:57:25,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:57:25,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 00:57:25,970 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:57:25,971 INFO L351 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 62 treesize of output 57 [2023-11-12 00:57:25,979 INFO L351 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 30 treesize of output 13 [2023-11-12 00:57:26,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:26,095 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-12 00:57:26,101 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:26,102 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-12 00:57:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:26,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:26,208 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_263 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2023-11-12 00:57:26,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_263) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_262) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_263 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_263) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2023-11-12 00:57:26,273 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:26,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-12 00:57:26,280 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:26,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-12 00:57:26,292 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:26,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2023-11-12 00:57:26,308 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:26,309 INFO L351 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 96 treesize of output 89 [2023-11-12 00:57:26,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-12 00:57:26,351 INFO L351 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-11-12 00:57:26,361 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:26,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-12 00:57:26,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:26,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:57:26,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-12 00:57:26,436 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:57:26,436 INFO L351 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-11-12 00:57:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:57:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437561417] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1317034858] [2023-11-12 00:57:26,504 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:57:26,505 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:26,505 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:26,505 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:26,505 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:28,658 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:30,547 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2665#(and (= |ULTIMATE.start_main_~y~0#1| 0) (or (and (exists ((|v_ULTIMATE.start_main_~p~0#1.base_129| Int) (|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int))) (|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_108| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~p~0#1.base_129| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~p~0#1.base_129|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|) 0))) (= |#memory_int| (store |v_#memory_int_77| |v_ULTIMATE.start_main_~p~0#1.base_129| (store (store (select |v_#memory_int_77| |v_ULTIMATE.start_main_~p~0#1.base_129|) |v_ULTIMATE.start_main_~p~0#1.offset_108| 3) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_129|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|))))) (= (store |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_main_~p~0#1.base_129| (store (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_main_~p~0#1.base_129|) |v_ULTIMATE.start_main_~p~0#1.offset_108| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_main_~p~0#1.base_129|) |v_ULTIMATE.start_main_~p~0#1.offset_108|))) |v_#memory_$Pointer$.base_88|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_main_~p~0#1.base_129| (store (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_main_~p~0#1.base_129|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|) 0))) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_129|) 1) (= (store |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~p~0#1.base_129| (store (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~p~0#1.base_129|) |v_ULTIMATE.start_main_~p~0#1.offset_108| (select (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~p~0#1.base_129|) |v_ULTIMATE.start_main_~p~0#1.offset_108|))) |v_#memory_$Pointer$.offset_87|) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_108|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_129|)) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_108|))) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~y~0#1_39| Int) (|v_ULTIMATE.start_main_#t~nondet9#1_45| Int) (|v_ULTIMATE.start_main_#t~short10#1_16| Bool) (|v_ULTIMATE.start_main_#t~nondet9#1_46| Int)) (and (or (and |v_ULTIMATE.start_main_#t~short10#1_16| (= |v_ULTIMATE.start_main_#t~nondet9#1_46| 0)) (and (not |v_ULTIMATE.start_main_#t~short10#1_16|) (= |v_ULTIMATE.start_main_#t~nondet9#1_46| |v_ULTIMATE.start_main_#t~nondet9#1_45|))) (or (and |v_ULTIMATE.start_main_#t~short10#1_16| (<= |v_ULTIMATE.start_main_~y~0#1_39| 9)) (and (<= 10 |v_ULTIMATE.start_main_~y~0#1_39|) (not |v_ULTIMATE.start_main_#t~short10#1_16|))))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|)) (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_112| Int) (|v_ULTIMATE.start_main_~p~0#1.base_133| Int)) (and (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_112|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_133|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_133|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_112|)) |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_133|) 1) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_112|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_133|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_112|)) |ULTIMATE.start_main_~p~0#1.offset|)))) (or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))))' at error location [2023-11-12 00:57:30,547 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:30,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-11-12 00:57:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921612814] [2023-11-12 00:57:30,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:30,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 00:57:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 00:57:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=951, Unknown=2, NotChecked=126, Total=1190 [2023-11-12 00:57:30,550 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:32,439 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2023-11-12 00:57:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-12 00:57:32,439 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-12 00:57:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:32,441 INFO L225 Difference]: With dead ends: 187 [2023-11-12 00:57:32,441 INFO L226 Difference]: Without dead ends: 187 [2023-11-12 00:57:32,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=282, Invalid=1791, Unknown=5, NotChecked=178, Total=2256 [2023-11-12 00:57:32,443 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 651 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:32,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 340 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 804 Invalid, 0 Unknown, 381 Unchecked, 0.9s Time] [2023-11-12 00:57:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-12 00:57:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 117. [2023-11-12 00:57:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 116 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2023-11-12 00:57:32,448 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 19 [2023-11-12 00:57:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:32,449 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2023-11-12 00:57:32,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2023-11-12 00:57:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:57:32,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:32,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:32,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:32,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:57:32,651 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:32,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2141986674, now seen corresponding path program 1 times [2023-11-12 00:57:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955081892] [2023-11-12 00:57:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:32,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:32,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955081892] [2023-11-12 00:57:32,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955081892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:57:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390574209] [2023-11-12 00:57:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:32,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:57:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:32,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:57:32,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:57:32,709 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-11-12 00:57:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:32,808 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2023-11-12 00:57:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:57:32,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-12 00:57:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:32,809 INFO L225 Difference]: With dead ends: 134 [2023-11-12 00:57:32,809 INFO L226 Difference]: Without dead ends: 134 [2023-11-12 00:57:32,809 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-11-12 00:57:32,810 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 99 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:32,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 48 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-12 00:57:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2023-11-12 00:57:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 122 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2023-11-12 00:57:32,816 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 20 [2023-11-12 00:57:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:32,816 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2023-11-12 00:57:32,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-11-12 00:57:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2023-11-12 00:57:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:57:32,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:32,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:32,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:57:32,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:32,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1159865781, now seen corresponding path program 1 times [2023-11-12 00:57:32,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:32,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016004921] [2023-11-12 00:57:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:32,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016004921] [2023-11-12 00:57:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016004921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:32,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:57:32,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270898759] [2023-11-12 00:57:32,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:32,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:57:32,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:57:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:57:32,921 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:33,066 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2023-11-12 00:57:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:57:33,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-12 00:57:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:33,068 INFO L225 Difference]: With dead ends: 150 [2023-11-12 00:57:33,068 INFO L226 Difference]: Without dead ends: 146 [2023-11-12 00:57:33,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:57:33,069 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 58 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:33,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 113 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-12 00:57:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2023-11-12 00:57:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 125 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2023-11-12 00:57:33,074 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 22 [2023-11-12 00:57:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:33,074 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2023-11-12 00:57:33,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2023-11-12 00:57:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:57:33,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:33,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:33,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:57:33,076 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:33,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:33,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1991834948, now seen corresponding path program 1 times [2023-11-12 00:57:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:33,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215027916] [2023-11-12 00:57:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:33,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215027916] [2023-11-12 00:57:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215027916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125317935] [2023-11-12 00:57:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:33,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:33,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:33,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:33,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:57:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:33,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-12 00:57:33,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:33,771 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:57:33,771 INFO L351 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-11-12 00:57:33,833 INFO L351 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 19 treesize of output 1 [2023-11-12 00:57:33,846 INFO L351 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 19 treesize of output 1 [2023-11-12 00:57:34,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:57:34,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-12 00:57:34,064 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-12 00:57:34,065 INFO L351 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 28 treesize of output 21 [2023-11-12 00:57:34,082 INFO L351 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-11-12 00:57:34,156 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:57:34,156 INFO L351 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 97 treesize of output 86 [2023-11-12 00:57:34,170 INFO L351 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 30 treesize of output 13 [2023-11-12 00:57:34,177 INFO L351 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 47 treesize of output 17 [2023-11-12 00:57:34,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:34,270 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-12 00:57:34,275 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:34,277 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:34,278 INFO L351 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 33 treesize of output 18 [2023-11-12 00:57:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:34,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:34,383 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (not (= v_ArrVal_355 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_355 .cse0))))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_355) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)))) is different from false [2023-11-12 00:57:34,401 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:34,402 INFO L351 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 88 treesize of output 92 [2023-11-12 00:57:34,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2023-11-12 00:57:34,438 INFO L351 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 98 treesize of output 87 [2023-11-12 00:57:34,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2023-11-12 00:57:34,608 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:34,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-12 00:57:34,619 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:34,619 INFO L351 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 36 treesize of output 35 [2023-11-12 00:57:34,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:57:34,642 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-12 00:57:34,642 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-12 00:57:34,697 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:57:34,698 INFO L351 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-11-12 00:57:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:34,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125317935] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:34,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732282009] [2023-11-12 00:57:34,760 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:57:34,760 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:34,761 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:34,761 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:34,761 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:36,923 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:38,881 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3712#(and (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (exists ((|v_#memory_$Pointer$.offset_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_125| Int) (|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_146| Int) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_125|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_main_~p~0#1.base_146| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_main_~p~0#1.base_146|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_125|) 0))) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_125|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_146|)) (= (store |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_main_~p~0#1.base_146| (store (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_main_~p~0#1.base_146|) |v_ULTIMATE.start_main_~p~0#1.offset_125| (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_main_~p~0#1.base_146|) |v_ULTIMATE.start_main_~p~0#1.offset_125|))) |v_#memory_$Pointer$.base_106|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_146|) 1) (= (store |v_#memory_$Pointer$.offset_104| |v_ULTIMATE.start_main_~p~0#1.base_146| (store (select |v_#memory_$Pointer$.offset_104| |v_ULTIMATE.start_main_~p~0#1.base_146|) |v_ULTIMATE.start_main_~p~0#1.offset_125| (select (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_main_~p~0#1.base_146|) |v_ULTIMATE.start_main_~p~0#1.offset_125|))) |v_#memory_$Pointer$.offset_105|) (= (store |v_#memory_int_94| |v_ULTIMATE.start_main_~p~0#1.base_146| (store (store (select |v_#memory_int_94| |v_ULTIMATE.start_main_~p~0#1.base_146|) |v_ULTIMATE.start_main_~p~0#1.offset_125| 3) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_125|) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_146|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_125|)))) |#memory_int|) (= (store |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_main_~p~0#1.base_146| (store (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_main_~p~0#1.base_146|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_125|) 0)) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (exists ((|v_ULTIMATE.start_main_#t~nondet9#1_50| Int) (|v_ULTIMATE.start_main_#t~short10#1_16| Bool) (|v_ULTIMATE.start_main_#t~nondet9#1_49| Int) (|v_ULTIMATE.start_main_~y~0#1_41| Int)) (and (or (and (<= |v_ULTIMATE.start_main_~y~0#1_41| 9) |v_ULTIMATE.start_main_#t~short10#1_16|) (and (not |v_ULTIMATE.start_main_#t~short10#1_16|) (<= 10 |v_ULTIMATE.start_main_~y~0#1_41|))) (or (and |v_ULTIMATE.start_main_#t~short10#1_16| (= |v_ULTIMATE.start_main_#t~nondet9#1_50| 0)) (and (not |v_ULTIMATE.start_main_#t~short10#1_16|) (= |v_ULTIMATE.start_main_#t~nondet9#1_49| |v_ULTIMATE.start_main_#t~nondet9#1_50|)))))) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_150| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_129| Int)) (and (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_129|) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_150|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_129|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_150|)) (= |ULTIMATE.start_main_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_150|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_129|))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_150|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_129|)) |ULTIMATE.start_main_~p~0#1.base|)))) (= |ULTIMATE.start_main_~y~0#1| 0) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)))' at error location [2023-11-12 00:57:38,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:38,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2023-11-12 00:57:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416210694] [2023-11-12 00:57:38,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:38,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-12 00:57:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-12 00:57:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1275, Unknown=1, NotChecked=72, Total=1482 [2023-11-12 00:57:38,884 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:40,382 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2023-11-12 00:57:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-12 00:57:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-12 00:57:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:40,384 INFO L225 Difference]: With dead ends: 163 [2023-11-12 00:57:40,384 INFO L226 Difference]: Without dead ends: 163 [2023-11-12 00:57:40,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=282, Invalid=2171, Unknown=1, NotChecked=96, Total=2550 [2023-11-12 00:57:40,386 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 380 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:40,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 420 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 904 Invalid, 0 Unknown, 163 Unchecked, 0.8s Time] [2023-11-12 00:57:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-12 00:57:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2023-11-12 00:57:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 125 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2023-11-12 00:57:40,391 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 22 [2023-11-12 00:57:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:40,391 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2023-11-12 00:57:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2023-11-12 00:57:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:57:40,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:40,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:40,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 00:57:40,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:40,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1671491112, now seen corresponding path program 1 times [2023-11-12 00:57:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:40,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553467238] [2023-11-12 00:57:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:40,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:40,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553467238] [2023-11-12 00:57:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553467238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:40,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 00:57:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085496585] [2023-11-12 00:57:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:40,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:57:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:40,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:57:40,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:57:40,846 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:41,142 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2023-11-12 00:57:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:57:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-12 00:57:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:41,143 INFO L225 Difference]: With dead ends: 142 [2023-11-12 00:57:41,144 INFO L226 Difference]: Without dead ends: 129 [2023-11-12 00:57:41,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-12 00:57:41,144 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 178 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:41,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 113 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-12 00:57:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2023-11-12 00:57:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.33) internal successors, (133), 114 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2023-11-12 00:57:41,148 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 23 [2023-11-12 00:57:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:41,148 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2023-11-12 00:57:41,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2023-11-12 00:57:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:57:41,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:41,149 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:41,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 00:57:41,150 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:41,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash 11625267, now seen corresponding path program 1 times [2023-11-12 00:57:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365532603] [2023-11-12 00:57:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:41,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:41,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365532603] [2023-11-12 00:57:41,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365532603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:41,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139638797] [2023-11-12 00:57:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:41,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:41,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:57:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:41,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 00:57:41,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:41,771 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:57:41,772 INFO L351 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-11-12 00:57:41,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:57:41,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:57:41,831 INFO L351 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-11-12 00:57:41,862 INFO L351 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-11-12 00:57:41,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:41,912 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:41,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:41,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-11-12 00:57:41,984 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-11-12 00:57:42,040 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:42,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-12 00:57:42,074 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-12 00:57:42,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2023-11-12 00:57:42,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-12 00:57:42,092 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:57:42,093 INFO L351 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-11-12 00:57:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:57:42,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139638797] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:42,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [82857009] [2023-11-12 00:57:42,150 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:57:42,150 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:42,151 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:42,151 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:42,151 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:43,449 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:45,607 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4470#(and (<= 0 |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2)) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_161| Int) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_138| Int) (|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_123| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~p~0#1.base_161| (store (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~p~0#1.base_161|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_138|) 0))) (= (store |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_main_~p~0#1.base_161| (store (select |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_main_~p~0#1.base_161|) |v_ULTIMATE.start_main_~p~0#1.offset_138| (select (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_main_~p~0#1.base_161|) |v_ULTIMATE.start_main_~p~0#1.offset_138|))) |v_#memory_$Pointer$.offset_122|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_main_~p~0#1.base_161| (store (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_main_~p~0#1.base_161|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_138|) 0))) (= |#memory_int| (store |v_#memory_int_115| |v_ULTIMATE.start_main_~p~0#1.base_161| (store (store (select |v_#memory_int_115| |v_ULTIMATE.start_main_~p~0#1.base_161|) |v_ULTIMATE.start_main_~p~0#1.offset_138| 3) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_138|) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_161|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_138|))))) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_161|) 1) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_138|) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_138|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_161|)) (= |v_#memory_$Pointer$.base_124| (store |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_main_~p~0#1.base_161| (store (select |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_main_~p~0#1.base_161|) |v_ULTIMATE.start_main_~p~0#1.offset_138| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~p~0#1.base_161|) |v_ULTIMATE.start_main_~p~0#1.offset_138|)))))) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))' at error location [2023-11-12 00:57:45,607 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:45,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-11-12 00:57:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860682102] [2023-11-12 00:57:45,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:45,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 00:57:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 00:57:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1043, Unknown=4, NotChecked=134, Total=1332 [2023-11-12 00:57:45,610 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:46,222 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2023-11-12 00:57:46,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:57:46,222 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-12 00:57:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:46,223 INFO L225 Difference]: With dead ends: 136 [2023-11-12 00:57:46,223 INFO L226 Difference]: Without dead ends: 136 [2023-11-12 00:57:46,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=205, Invalid=1359, Unknown=4, NotChecked=154, Total=1722 [2023-11-12 00:57:46,225 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 281 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:46,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 203 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 428 Invalid, 0 Unknown, 213 Unchecked, 0.4s Time] [2023-11-12 00:57:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-12 00:57:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2023-11-12 00:57:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 116 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2023-11-12 00:57:46,228 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 23 [2023-11-12 00:57:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:46,229 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2023-11-12 00:57:46,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2023-11-12 00:57:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:57:46,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:46,230 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:46,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:46,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-12 00:57:46,437 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:46,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1668579217, now seen corresponding path program 1 times [2023-11-12 00:57:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:46,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91171453] [2023-11-12 00:57:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:46,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:46,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91171453] [2023-11-12 00:57:46,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91171453] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:46,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160174092] [2023-11-12 00:57:46,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:46,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:46,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:46,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:46,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:57:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:46,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-12 00:57:46,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:47,005 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:57:47,005 INFO L351 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-11-12 00:57:47,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:57:47,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:57:47,084 INFO L351 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-11-12 00:57:47,115 INFO L351 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-11-12 00:57:47,174 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:47,184 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:47,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:47,233 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-11-12 00:57:47,339 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:47,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-12 00:57:47,355 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-12 00:57:47,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2023-11-12 00:57:47,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-12 00:57:47,374 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:57:47,374 INFO L351 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-11-12 00:57:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:57:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160174092] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [509251921] [2023-11-12 00:57:47,436 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:57:47,436 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:47,436 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:47,436 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:47,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:48,911 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:51,469 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4903#(and (<= 0 |ULTIMATE.start_main_~p~0#1.offset|) (exists ((|v_ULTIMATE.start_main_#t~short10#1_16| Bool) (|v_ULTIMATE.start_main_#t~nondet9#1_69| Int) (|v_ULTIMATE.start_main_#t~nondet9#1_68| Int) (|v_ULTIMATE.start_main_~y~0#1_51| Int)) (and (or (and |v_ULTIMATE.start_main_#t~short10#1_16| (= |v_ULTIMATE.start_main_#t~nondet9#1_69| 0)) (and (= |v_ULTIMATE.start_main_#t~nondet9#1_69| |v_ULTIMATE.start_main_#t~nondet9#1_68|) (not |v_ULTIMATE.start_main_#t~short10#1_16|))) (or (and (<= 10 |v_ULTIMATE.start_main_~y~0#1_51|) (not |v_ULTIMATE.start_main_#t~short10#1_16|)) (and |v_ULTIMATE.start_main_#t~short10#1_16| (<= |v_ULTIMATE.start_main_~y~0#1_51| 9))))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2)) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_171| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_146| Int) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_main_~p~0#1.base_171| (store (select |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_main_~p~0#1.base_171|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_146|) 0))) (= (store |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~p~0#1.base_171| (store (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~p~0#1.base_171|) |v_ULTIMATE.start_main_~p~0#1.offset_146| (select (select |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_main_~p~0#1.base_171|) |v_ULTIMATE.start_main_~p~0#1.offset_146|))) |v_#memory_$Pointer$.offset_136|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_146|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_171|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~p~0#1.base_171| (store (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~p~0#1.base_171|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_146|) 0))) (= (store |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_main_~p~0#1.base_171| (store (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_main_~p~0#1.base_171|) |v_ULTIMATE.start_main_~p~0#1.offset_146| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~p~0#1.base_171|) |v_ULTIMATE.start_main_~p~0#1.offset_146|))) |v_#memory_$Pointer$.base_139|) (= (store |v_#memory_int_133| |v_ULTIMATE.start_main_~p~0#1.base_171| (store (store (select |v_#memory_int_133| |v_ULTIMATE.start_main_~p~0#1.base_171|) |v_ULTIMATE.start_main_~p~0#1.offset_146| 3) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_146|) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_171|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_146|)))) |#memory_int|) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_146|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_171|)))) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))' at error location [2023-11-12 00:57:51,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:51,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:51,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-12 00:57:51,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394895020] [2023-11-12 00:57:51,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:51,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 00:57:51,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:51,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 00:57:51,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1044, Unknown=5, NotChecked=66, Total=1260 [2023-11-12 00:57:51,471 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:52,229 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2023-11-12 00:57:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:57:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-12 00:57:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:52,230 INFO L225 Difference]: With dead ends: 134 [2023-11-12 00:57:52,230 INFO L226 Difference]: Without dead ends: 134 [2023-11-12 00:57:52,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=201, Invalid=1358, Unknown=5, NotChecked=76, Total=1640 [2023-11-12 00:57:52,232 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 263 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:52,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 358 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 709 Invalid, 0 Unknown, 108 Unchecked, 0.5s Time] [2023-11-12 00:57:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-12 00:57:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2023-11-12 00:57:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.31) internal successors, (131), 114 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2023-11-12 00:57:52,236 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 23 [2023-11-12 00:57:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:52,236 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2023-11-12 00:57:52,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:57:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2023-11-12 00:57:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:57:52,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:52,237 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] [2023-11-12 00:57:52,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:52,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-12 00:57:52,443 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:57:52,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash 475150511, now seen corresponding path program 1 times [2023-11-12 00:57:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:52,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870542424] [2023-11-12 00:57:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:53,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870542424] [2023-11-12 00:57:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870542424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834543461] [2023-11-12 00:57:53,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:53,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:53,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:53,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:53,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ee86169-af8f-47e7-87b9-41bf4a285969/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:57:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:53,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-12 00:57:53,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:53,280 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:57:53,280 INFO L351 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-11-12 00:57:53,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-12 00:57:53,348 INFO L351 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 19 treesize of output 1 [2023-11-12 00:57:53,355 INFO L351 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 19 treesize of output 1 [2023-11-12 00:57:53,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-12 00:57:53,484 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-12 00:57:53,484 INFO L351 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 39 treesize of output 30 [2023-11-12 00:57:53,499 INFO L351 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-11-12 00:57:53,552 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:57:53,553 INFO L351 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 88 treesize of output 79 [2023-11-12 00:57:53,559 INFO L351 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 47 treesize of output 17 [2023-11-12 00:57:53,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:53,741 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:53,741 INFO L351 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 44 treesize of output 23 [2023-11-12 00:57:53,784 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:53,784 INFO L351 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 15 treesize of output 15 [2023-11-12 00:57:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:53,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:54,264 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:54,265 INFO L351 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 70 treesize of output 74 [2023-11-12 00:57:54,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:54,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42