./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:11:55,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:11:55,366 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:11:55,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:11:55,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:11:55,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:11:55,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:11:55,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:11:55,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:11:55,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:11:55,426 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:11:55,427 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:11:55,427 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:11:55,428 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:11:55,428 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:11:55,429 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:11:55,429 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:11:55,429 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:11:55,430 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:11:55,431 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:11:55,431 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:11:55,432 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:11:55,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:11:55,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:11:55,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:11:55,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:11:55,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:11:55,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:11:55,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:11:55,436 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:11:55,436 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:11:55,437 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:11:55,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:11:55,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:11:55,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:11:55,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:11:55,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:11:55,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:11:55,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:11:55,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:11:55,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:11:55,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:11:55,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:11:55,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:11:55,442 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:11:55,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:11:55,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:11:55,443 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:11:55,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:11:55,444 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_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/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_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2024-11-09 06:11:55,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:11:55,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:11:55,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:11:55,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:11:55,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:11:55,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/forester-heap/dll-token-1.i Unable to find full path for "g++" [2024-11-09 06:11:57,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:11:58,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:11:58,116 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/sv-benchmarks/c/forester-heap/dll-token-1.i [2024-11-09 06:11:58,135 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/data/781b72f8a/7dd2156cab754a18afbf684740dd7b99/FLAGc8c5bc530 [2024-11-09 06:11:58,150 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/data/781b72f8a/7dd2156cab754a18afbf684740dd7b99 [2024-11-09 06:11:58,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:11:58,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:11:58,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:11:58,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:11:58,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:11:58,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffc2c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58, skipping insertion in model container [2024-11-09 06:11:58,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:11:58,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:11:58,670 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:11:58,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:11:58,778 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:11:58,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58 WrapperNode [2024-11-09 06:11:58,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:11:58,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:11:58,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:11:58,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:11:58,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,842 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2024-11-09 06:11:58,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:11:58,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:11:58,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:11:58,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:11:58,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:11:58,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:11:58,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:11:58,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:11:58,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (1/1) ... [2024-11-09 06:11:58,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:11:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:58,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:11:58,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:11:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:11:58,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:11:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:11:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:11:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:11:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:11:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:11:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:11:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:11:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:11:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:11:58,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:11:59,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:11:59,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:11:59,573 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-09 06:11:59,573 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:11:59,650 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:11:59,650 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-09 06:11:59,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:11:59 BoogieIcfgContainer [2024-11-09 06:11:59,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:11:59,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:11:59,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:11:59,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:11:59,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:11:58" (1/3) ... [2024-11-09 06:11:59,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3012b4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:11:59, skipping insertion in model container [2024-11-09 06:11:59,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:58" (2/3) ... [2024-11-09 06:11:59,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3012b4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:11:59, skipping insertion in model container [2024-11-09 06:11:59,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:11:59" (3/3) ... [2024-11-09 06:11:59,666 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2024-11-09 06:11:59,689 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:11:59,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-09 06:11:59,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:11:59,778 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@2fa6fff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:11:59,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-09 06:11:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:11:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 06:11:59,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:59,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 06:11:59,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:11:59,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 9592, now seen corresponding path program 1 times [2024-11-09 06:11:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:59,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791318341] [2024-11-09 06:11:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:00,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791318341] [2024-11-09 06:12:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791318341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:00,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:12:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909844147] [2024-11-09 06:12:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:00,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:12:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:12:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:12:00,095 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:00,305 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2024-11-09 06:12:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:12:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 06:12:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:00,319 INFO L225 Difference]: With dead ends: 117 [2024-11-09 06:12:00,319 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 06:12:00,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:12:00,326 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:00,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 100 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 06:12:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 06:12:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2024-11-09 06:12:00,381 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2024-11-09 06:12:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:00,382 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2024-11-09 06:12:00,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2024-11-09 06:12:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 06:12:00,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:00,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 06:12:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:12:00,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 9593, now seen corresponding path program 1 times [2024-11-09 06:12:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:00,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983652205] [2024-11-09 06:12:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:00,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983652205] [2024-11-09 06:12:00,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983652205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:00,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:12:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356856362] [2024-11-09 06:12:00,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:12:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:12:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:12:00,556 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:00,712 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2024-11-09 06:12:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:12:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 06:12:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:00,714 INFO L225 Difference]: With dead ends: 118 [2024-11-09 06:12:00,715 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 06:12:00,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:12:00,717 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:00,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 169 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 06:12:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2024-11-09 06:12:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2024-11-09 06:12:00,731 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2024-11-09 06:12:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:00,732 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2024-11-09 06:12:00,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-11-09 06:12:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:12:00,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:00,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:00,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:12:00,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:00,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash -273500444, now seen corresponding path program 1 times [2024-11-09 06:12:00,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:00,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19583946] [2024-11-09 06:12:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:00,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:00,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19583946] [2024-11-09 06:12:00,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19583946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:00,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:12:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363433994] [2024-11-09 06:12:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:00,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:12:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:12:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:12:00,891 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:01,163 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-09 06:12:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:12:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:01,165 INFO L225 Difference]: With dead ends: 100 [2024-11-09 06:12:01,165 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 06:12:01,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:01,167 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 109 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:01,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 67 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 06:12:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 06:12:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-09 06:12:01,178 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2024-11-09 06:12:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:01,178 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-09 06:12:01,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-09 06:12:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:12:01,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:01,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:01,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:12:01,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:01,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash -273500443, now seen corresponding path program 1 times [2024-11-09 06:12:01,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:01,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687703925] [2024-11-09 06:12:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:01,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:01,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687703925] [2024-11-09 06:12:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687703925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:01,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:01,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:12:01,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458416031] [2024-11-09 06:12:01,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:01,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:12:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:01,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:12:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:12:01,488 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:01,726 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-11-09 06:12:01,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:12:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:01,728 INFO L225 Difference]: With dead ends: 109 [2024-11-09 06:12:01,728 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 06:12:01,731 INFO L431 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 [2024-11-09 06:12:01,735 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:01,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 180 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 06:12:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-09 06:12:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 105 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2024-11-09 06:12:01,752 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 7 [2024-11-09 06:12:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:01,756 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2024-11-09 06:12:01,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2024-11-09 06:12:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:12:01,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:01,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:01,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:12:01,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -273500420, now seen corresponding path program 1 times [2024-11-09 06:12:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:01,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232613320] [2024-11-09 06:12:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:01,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:02,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:02,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232613320] [2024-11-09 06:12:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232613320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:02,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:12:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392432523] [2024-11-09 06:12:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:02,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:12:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:02,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:12:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:02,102 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:02,375 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-11-09 06:12:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:12:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:12:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:02,377 INFO L225 Difference]: With dead ends: 141 [2024-11-09 06:12:02,377 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 06:12:02,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:12:02,378 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 251 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:02,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 92 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 06:12:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 126. [2024-11-09 06:12:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.670731707317073) internal successors, (137), 124 states have internal predecessors, (137), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2024-11-09 06:12:02,392 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 7 [2024-11-09 06:12:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:02,392 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2024-11-09 06:12:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2024-11-09 06:12:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:12:02,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:02,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:12:02,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:02,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash -840669683, now seen corresponding path program 1 times [2024-11-09 06:12:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823494897] [2024-11-09 06:12:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:02,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823494897] [2024-11-09 06:12:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823494897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:12:02,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892322535] [2024-11-09 06:12:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:02,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:12:02,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:12:02,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:02,568 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:02,772 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2024-11-09 06:12:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:02,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 06:12:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:02,774 INFO L225 Difference]: With dead ends: 125 [2024-11-09 06:12:02,774 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 06:12:02,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:02,776 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:02,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 250 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 06:12:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 06:12:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.646341463414634) internal successors, (135), 123 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-11-09 06:12:02,795 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 9 [2024-11-09 06:12:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:02,796 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-11-09 06:12:02,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-11-09 06:12:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:12:02,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:02,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:02,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:12:02,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -840669682, now seen corresponding path program 1 times [2024-11-09 06:12:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270326293] [2024-11-09 06:12:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:03,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:03,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270326293] [2024-11-09 06:12:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270326293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:12:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517270387] [2024-11-09 06:12:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:03,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:12:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:03,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:12:03,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:03,034 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:03,226 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2024-11-09 06:12:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 06:12:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:03,228 INFO L225 Difference]: With dead ends: 124 [2024-11-09 06:12:03,228 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 06:12:03,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:03,230 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:03,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 243 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 06:12:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 06:12:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 122 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2024-11-09 06:12:03,239 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 9 [2024-11-09 06:12:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:03,239 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2024-11-09 06:12:03,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2024-11-09 06:12:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:12:03,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:03,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:03,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:12:03,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:03,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash -292390840, now seen corresponding path program 1 times [2024-11-09 06:12:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959612743] [2024-11-09 06:12:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:03,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:03,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959612743] [2024-11-09 06:12:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959612743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:03,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:03,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:12:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220486821] [2024-11-09 06:12:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:03,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:12:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:12:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:03,448 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:03,619 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-11-09 06:12:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:12:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:03,621 INFO L225 Difference]: With dead ends: 123 [2024-11-09 06:12:03,621 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 06:12:03,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:03,622 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:03,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 244 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 06:12:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 06:12:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 121 states have internal predecessors, (131), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2024-11-09 06:12:03,630 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 10 [2024-11-09 06:12:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:03,631 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2024-11-09 06:12:03,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2024-11-09 06:12:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:12:03,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:03,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:03,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:12:03,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:03,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash -292390839, now seen corresponding path program 1 times [2024-11-09 06:12:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634165588] [2024-11-09 06:12:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:03,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:03,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634165588] [2024-11-09 06:12:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634165588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:12:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883826460] [2024-11-09 06:12:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:03,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:12:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:12:03,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:03,823 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:03,994 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2024-11-09 06:12:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:12:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:03,996 INFO L225 Difference]: With dead ends: 122 [2024-11-09 06:12:03,996 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 06:12:03,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:03,997 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:03,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 238 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 06:12:04,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 06:12:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 120 states have internal predecessors, (129), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-09 06:12:04,003 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 10 [2024-11-09 06:12:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:04,003 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-09 06:12:04,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-09 06:12:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:12:04,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:04,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:04,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:12:04,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash -429482252, now seen corresponding path program 1 times [2024-11-09 06:12:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070939269] [2024-11-09 06:12:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:04,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:04,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070939269] [2024-11-09 06:12:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070939269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:04,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:04,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:12:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511809346] [2024-11-09 06:12:04,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:12:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:12:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:12:04,406 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:04,940 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2024-11-09 06:12:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:12:04,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:12:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:04,942 INFO L225 Difference]: With dead ends: 114 [2024-11-09 06:12:04,942 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 06:12:04,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:12:04,943 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 106 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:04,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 173 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:12:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 06:12:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2024-11-09 06:12:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 101 states have internal predecessors, (109), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2024-11-09 06:12:04,947 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 11 [2024-11-09 06:12:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:04,948 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2024-11-09 06:12:04,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2024-11-09 06:12:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:12:04,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:04,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:04,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:12:04,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:04,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash -429482253, now seen corresponding path program 1 times [2024-11-09 06:12:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:04,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430176272] [2024-11-09 06:12:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:05,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430176272] [2024-11-09 06:12:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430176272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:05,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:05,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:12:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704572421] [2024-11-09 06:12:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:05,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:12:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:05,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:12:05,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:12:05,180 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:05,470 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2024-11-09 06:12:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:12:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:12:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:05,472 INFO L225 Difference]: With dead ends: 102 [2024-11-09 06:12:05,472 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 06:12:05,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:12:05,473 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 94 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:05,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 153 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 06:12:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 06:12:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 100 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2024-11-09 06:12:05,478 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 11 [2024-11-09 06:12:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:05,478 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2024-11-09 06:12:05,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2024-11-09 06:12:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:12:05,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:05,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:05,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:12:05,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:05,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1814530959, now seen corresponding path program 1 times [2024-11-09 06:12:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664257735] [2024-11-09 06:12:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:05,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:05,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664257735] [2024-11-09 06:12:05,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664257735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:05,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:12:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991566221] [2024-11-09 06:12:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:12:05,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:12:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:12:05,722 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:05,879 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-11-09 06:12:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:12:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 06:12:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:05,880 INFO L225 Difference]: With dead ends: 101 [2024-11-09 06:12:05,880 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 06:12:05,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:12:05,881 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:05,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 06:12:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 06:12:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 states have internal predecessors, (107), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2024-11-09 06:12:05,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 12 [2024-11-09 06:12:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:05,884 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2024-11-09 06:12:05,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2024-11-09 06:12:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:12:05,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:05,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:12:05,885 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1814530958, now seen corresponding path program 1 times [2024-11-09 06:12:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436205480] [2024-11-09 06:12:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:06,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436205480] [2024-11-09 06:12:06,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436205480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:06,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:06,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:12:06,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926560232] [2024-11-09 06:12:06,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:06,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:12:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:12:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:12:06,338 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:06,795 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-11-09 06:12:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:12:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 06:12:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:06,796 INFO L225 Difference]: With dead ends: 130 [2024-11-09 06:12:06,797 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 06:12:06,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:12:06,797 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 108 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:06,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 255 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:12:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 06:12:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 109. [2024-11-09 06:12:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 107 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2024-11-09 06:12:06,801 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 12 [2024-11-09 06:12:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:06,802 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2024-11-09 06:12:06,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2024-11-09 06:12:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:12:06,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:06,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:12:06,803 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 55977790, now seen corresponding path program 1 times [2024-11-09 06:12:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808255187] [2024-11-09 06:12:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:07,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808255187] [2024-11-09 06:12:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808255187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:07,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:07,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:12:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015540903] [2024-11-09 06:12:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:07,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:12:07,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:12:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:12:07,085 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:07,517 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-09 06:12:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:12:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 06:12:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:07,519 INFO L225 Difference]: With dead ends: 112 [2024-11-09 06:12:07,519 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 06:12:07,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:12:07,520 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 102 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:07,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 177 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:12:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 06:12:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2024-11-09 06:12:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 106 states have internal predecessors, (115), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2024-11-09 06:12:07,527 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 15 [2024-11-09 06:12:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:07,527 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2024-11-09 06:12:07,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2024-11-09 06:12:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:12:07,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:07,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:12:07,531 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1534613876, now seen corresponding path program 1 times [2024-11-09 06:12:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197651923] [2024-11-09 06:12:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:07,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:07,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197651923] [2024-11-09 06:12:07,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197651923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:07,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:07,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:12:07,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227572935] [2024-11-09 06:12:07,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:07,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:12:07,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:07,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:12:07,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:12:07,600 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:07,737 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2024-11-09 06:12:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:07,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 06:12:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:07,740 INFO L225 Difference]: With dead ends: 128 [2024-11-09 06:12:07,740 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 06:12:07,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:07,741 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:07,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 117 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 06:12:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2024-11-09 06:12:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 105 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-09 06:12:07,747 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 16 [2024-11-09 06:12:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:07,747 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-09 06:12:07,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-09 06:12:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:12:07,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:07,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:07,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:12:07,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:07,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:07,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1590556471, now seen corresponding path program 1 times [2024-11-09 06:12:07,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:07,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427950082] [2024-11-09 06:12:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:07,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:07,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427950082] [2024-11-09 06:12:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427950082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:07,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:07,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:12:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195704406] [2024-11-09 06:12:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:12:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:12:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:07,832 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:07,972 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2024-11-09 06:12:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:07,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:12:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:07,974 INFO L225 Difference]: With dead ends: 106 [2024-11-09 06:12:07,974 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 06:12:07,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:12:07,976 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:07,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 06:12:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 06:12:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 104 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-09 06:12:07,984 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 21 [2024-11-09 06:12:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:07,985 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-09 06:12:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-09 06:12:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:12:07,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:07,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:07,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:12:07,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1559039515, now seen corresponding path program 1 times [2024-11-09 06:12:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528941677] [2024-11-09 06:12:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:08,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528941677] [2024-11-09 06:12:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528941677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:08,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:12:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589314173] [2024-11-09 06:12:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:08,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:12:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:12:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:12:08,517 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:08,834 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2024-11-09 06:12:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:12:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:12:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:08,835 INFO L225 Difference]: With dead ends: 119 [2024-11-09 06:12:08,836 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 06:12:08,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:12:08,836 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:08,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 310 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:12:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 06:12:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2024-11-09 06:12:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 108 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2024-11-09 06:12:08,840 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 21 [2024-11-09 06:12:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:08,841 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2024-11-09 06:12:08,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2024-11-09 06:12:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:12:08,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:08,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:08,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:12:08,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:08,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1590524835, now seen corresponding path program 1 times [2024-11-09 06:12:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781650292] [2024-11-09 06:12:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:09,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781650292] [2024-11-09 06:12:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781650292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:09,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:12:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186019276] [2024-11-09 06:12:09,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:09,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:12:09,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:09,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:12:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:12:09,271 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:09,616 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2024-11-09 06:12:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:12:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:12:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:09,617 INFO L225 Difference]: With dead ends: 120 [2024-11-09 06:12:09,617 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 06:12:09,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:12:09,618 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:09,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 161 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:12:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 06:12:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2024-11-09 06:12:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 113 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2024-11-09 06:12:09,622 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2024-11-09 06:12:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:09,622 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2024-11-09 06:12:09,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2024-11-09 06:12:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:12:09,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:09,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:12:09,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1590524834, now seen corresponding path program 1 times [2024-11-09 06:12:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032638940] [2024-11-09 06:12:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:10,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032638940] [2024-11-09 06:12:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032638940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:12:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916665486] [2024-11-09 06:12:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:10,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:12:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:12:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:12:10,176 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:10,532 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2024-11-09 06:12:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:12:10,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:12:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:10,534 INFO L225 Difference]: With dead ends: 124 [2024-11-09 06:12:10,534 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 06:12:10,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:12:10,535 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:10,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 260 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:12:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 06:12:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2024-11-09 06:12:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.375) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-09 06:12:10,540 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 21 [2024-11-09 06:12:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:10,540 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-09 06:12:10,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-09 06:12:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:12:10,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:10,541 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:12:10,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1691547256, now seen corresponding path program 1 times [2024-11-09 06:12:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405433420] [2024-11-09 06:12:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:12:11,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:11,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405433420] [2024-11-09 06:12:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405433420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:12:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580051306] [2024-11-09 06:12:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:12:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:12:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:12:11,211 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:11,832 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-11-09 06:12:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:12:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:12:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:11,834 INFO L225 Difference]: With dead ends: 114 [2024-11-09 06:12:11,834 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 06:12:11,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:12:11,835 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:11,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 296 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:12:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 06:12:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 06:12:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-11-09 06:12:11,839 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 21 [2024-11-09 06:12:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:11,840 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-11-09 06:12:11,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-11-09 06:12:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:12:11,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:11,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:12:11,842 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 28748914, now seen corresponding path program 1 times [2024-11-09 06:12:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601624995] [2024-11-09 06:12:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:12,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:12,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601624995] [2024-11-09 06:12:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601624995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:12,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:12:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242567787] [2024-11-09 06:12:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:12,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:12:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:12:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:12:12,557 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:12,925 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-11-09 06:12:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:12:12,926 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 06:12:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:12,927 INFO L225 Difference]: With dead ends: 122 [2024-11-09 06:12:12,927 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 06:12:12,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:12:12,928 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 89 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:12,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 323 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:12:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 06:12:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2024-11-09 06:12:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-09 06:12:12,954 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 25 [2024-11-09 06:12:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:12,954 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-09 06:12:12,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-09 06:12:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 06:12:12,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:12,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:12,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:12:12,955 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:12,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1008522196, now seen corresponding path program 1 times [2024-11-09 06:12:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461438205] [2024-11-09 06:12:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:13,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:13,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461438205] [2024-11-09 06:12:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461438205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:13,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:13,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:12:13,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686423592] [2024-11-09 06:12:13,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:13,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:12:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:12:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:12:13,047 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:13,158 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2024-11-09 06:12:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 06:12:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:13,160 INFO L225 Difference]: With dead ends: 129 [2024-11-09 06:12:13,160 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 06:12:13,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:13,161 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 69 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:13,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 126 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 06:12:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2024-11-09 06:12:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2024-11-09 06:12:13,165 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 28 [2024-11-09 06:12:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:13,165 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2024-11-09 06:12:13,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2024-11-09 06:12:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:12:13,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:13,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:13,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:12:13,166 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:13,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1199416762, now seen corresponding path program 1 times [2024-11-09 06:12:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:13,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925599798] [2024-11-09 06:12:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:13,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:13,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:13,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925599798] [2024-11-09 06:12:13,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925599798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:13,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:13,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:12:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094371095] [2024-11-09 06:12:13,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:13,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:12:13,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:12:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:12:13,257 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:13,407 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-09 06:12:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:12:13,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 06:12:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:13,409 INFO L225 Difference]: With dead ends: 131 [2024-11-09 06:12:13,409 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 06:12:13,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:12:13,410 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 72 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:13,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 98 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:12:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 06:12:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2024-11-09 06:12:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 120 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-11-09 06:12:13,414 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 29 [2024-11-09 06:12:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:13,414 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-11-09 06:12:13,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:12:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-11-09 06:12:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:12:13,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:13,415 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:13,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:12:13,416 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:12:13,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1466283407, now seen corresponding path program 1 times [2024-11-09 06:12:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:13,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265824199] [2024-11-09 06:12:13,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:14,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265824199] [2024-11-09 06:12:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265824199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613588164] [2024-11-09 06:12:14,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:14,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:14,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:12:14,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:14,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:12:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:14,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 06:12:14,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:14,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:12:14,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:12:14,744 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:12:14,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:12:14,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:12:14,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:12:14,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:12:15,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:12:15,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 06:12:15,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:12:15,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 06:12:15,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:12:15,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:12:15,347 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 06:12:15,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 06:12:15,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:12:15,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:12:15,563 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:12:15,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-11-09 06:12:15,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:12:15,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 06:12:15,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:12:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:15,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:15,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-09 06:12:15,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-09 06:12:15,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_950) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_949) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-09 06:12:15,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_950) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_949) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2024-11-09 06:12:15,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:15,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-09 06:12:15,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-09 06:12:15,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-09 06:12:15,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (not .cse0) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_950) v_arrayElimCell_18 v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))) (or (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) .cse0) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_947))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_950) v_arrayElimCell_18 v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))))) is different from false [2024-11-09 06:12:18,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:18,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 137 [2024-11-09 06:12:19,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 233 [2024-11-09 06:12:19,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 213 [2024-11-09 06:12:19,247 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-09 06:12:19,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 330 [2024-11-09 06:12:19,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2024-11-09 06:12:37,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse49 (store .cse48 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse48 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store .cse49 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse49 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse1 (forall ((v_ArrVal_942 (Array Int Int))) (or (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse47 (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse47 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse47 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse2 (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_20 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse45 (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse45 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse45 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse4 (forall ((v_ArrVal_942 (Array Int Int))) (or (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse43 (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse43 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse43 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse9 (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse41 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse41 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse10 (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse40 (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse40 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse40 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse11 (forall ((v_ArrVal_942 (Array Int Int))) (or (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_19 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse38 (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse38 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse38 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse21 (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_ArrVal_947 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse17 (not .cse0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_20 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= (select (select (store .cse7 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse7 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse9 .cse10 .cse11)) (forall ((v_ArrVal_942 (Array Int Int))) (or (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_prenex_19 Int)) (or (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse13 (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store .cse13 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse13 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_ArrVal_943 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_arrayElimCell_27 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_27)))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or (forall ((v_ArrVal_942 (Array Int Int)) (v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse15 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse15 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)))) .cse0) (or .cse0 (and .cse1 .cse3 .cse9 .cse11)) (or (and .cse1 .cse2 .cse4 .cse9 .cse10 .cse11) .cse0) (or (forall ((v_ArrVal_942 (Array Int Int)) (v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_arrayElimCell_20 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18))) (or (= (select (select (store (store .cse16 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store .cse16 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse17) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store .cse19 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse19 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_ArrVal_943 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_arrayElimCell_27 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_27)))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse0 (and .cse21 (forall ((v_ArrVal_942 (Array Int Int))) (or (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_943 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_arrayElimCell_27 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)))))))) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_ArrVal_943 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_arrayElimCell_27 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_arrayElimCell_27 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_27))) .cse17) (or (and .cse21 (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (forall ((v_ArrVal_943 (Array Int Int))) (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)) (= (select (select (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse0) (or .cse17 (forall ((v_ArrVal_942 (Array Int Int)) (v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_arrayElimCell_20 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18))) (or (= (select (select (store (store .cse25 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store .cse25 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (or (and (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (forall ((v_ArrVal_943 (Array Int Int))) (= (select (select (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)) (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse0) (or (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_arrayElimCell_27 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_943) v_arrayElimCell_27 v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_27))) .cse17) (forall ((v_ArrVal_942 (Array Int Int))) (or (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_20 Int) (v_prenex_17 (Array Int Int)) (v_prenex_19 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse28 (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse28 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse28 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))))) (or .cse0 (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_951 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_947) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)))) (or (forall ((v_ArrVal_942 (Array Int Int)) (v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_arrayElimCell_20 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0)))) .cse17) (or .cse17 (forall ((v_ArrVal_942 (Array Int Int)) (v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_arrayElimCell_20 Int) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (or (= (select (select (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_20 Int) (v_prenex_19 Int)) (or (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse32 (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store .cse32 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse32 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_19 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse34 (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse34 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse34 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_942 (Array Int Int))) (or (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((v_arrayElimCell_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_19 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_942))) (let ((.cse36 (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18))) (or (= (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_20 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= v_prenex_19 v_arrayElimCell_20) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= (select (select (store .cse36 v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0) (= (select (select (store (store .cse36 v_prenex_19 v_ArrVal_950) v_arrayElimCell_18 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) 0))))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_942 (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_942 |c_ULTIMATE.start_main_~x~0#1.offset|))))))))) is different from false [2024-11-09 06:12:59,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25760 treesize of output 25712 [2024-11-09 06:13:00,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2108 treesize of output 2100 [2024-11-09 06:13:00,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2100 treesize of output 2092 [2024-11-09 06:13:00,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2092 treesize of output 2084 [2024-11-09 06:13:00,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2084 treesize of output 2076 [2024-11-09 06:13:00,362 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:01,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:13:01,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 24 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 24 new quantified variables, introduced 48 case distinctions, treesize of input 2076 treesize of output 7189 [2024-11-09 06:13:03,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1836 treesize of output 1820 [2024-11-09 06:13:04,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1820 treesize of output 1816 [2024-11-09 06:13:05,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1816 treesize of output 1808 [2024-11-09 06:13:06,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1808 treesize of output 1804 [2024-11-09 06:13:07,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1804 treesize of output 1800 [2024-11-09 06:13:08,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1800 treesize of output 1792 [2024-11-09 06:13:09,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1792 treesize of output 1788 [2024-11-09 06:13:10,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1788 treesize of output 1784 [2024-11-09 06:13:11,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1784 treesize of output 1780 [2024-11-09 06:13:12,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1780 treesize of output 1776 [2024-11-09 06:13:13,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1776 treesize of output 1772 [2024-11-09 06:13:14,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1772 treesize of output 1768 [2024-11-09 06:13:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1768 treesize of output 1764 [2024-11-09 06:13:16,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1764 treesize of output 1760 [2024-11-09 06:13:17,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1760 treesize of output 1756 [2024-11-09 06:13:18,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1756 treesize of output 1752 [2024-11-09 06:13:19,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1752 treesize of output 1744 [2024-11-09 06:13:20,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1744 treesize of output 1736 [2024-11-09 06:13:21,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1736 treesize of output 1732 [2024-11-09 06:13:22,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1732 treesize of output 1728 [2024-11-09 06:13:23,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1728 treesize of output 1724 [2024-11-09 06:13:24,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1724 treesize of output 1712 [2024-11-09 06:13:26,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1712 treesize of output 1708 [2024-11-09 06:13:27,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1708 treesize of output 1704 [2024-11-09 06:13:28,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1704 treesize of output 1700 [2024-11-09 06:13:29,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1700 treesize of output 1692 [2024-11-09 06:13:30,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1692 treesize of output 1688 [2024-11-09 06:13:31,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1688 treesize of output 1684 [2024-11-09 06:13:32,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1684 treesize of output 1680 [2024-11-09 06:13:33,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1680 treesize of output 1676 [2024-11-09 06:13:34,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1676 treesize of output 1672 [2024-11-09 06:13:35,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1672 treesize of output 1668 [2024-11-09 06:13:36,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1668 treesize of output 1664 [2024-11-09 06:13:37,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1664 treesize of output 1656 [2024-11-09 06:13:38,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1656 treesize of output 1648 [2024-11-09 06:13:39,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1648 treesize of output 1644 [2024-11-09 06:13:40,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1644 treesize of output 1640 [2024-11-09 06:13:41,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1640 treesize of output 1624 [2024-11-09 06:13:43,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1624 treesize of output 1616 [2024-11-09 06:13:44,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1616 treesize of output 1608 [2024-11-09 06:13:45,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1608 treesize of output 1604 [2024-11-09 06:13:46,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1604 treesize of output 1600 [2024-11-09 06:13:47,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1600 treesize of output 1592 [2024-11-09 06:13:47,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1592 treesize of output 1588 [2024-11-09 06:13:48,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1588 treesize of output 1584 [2024-11-09 06:13:53,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:55,164 INFO L224 Elim1Store]: Index analysis took 1854 ms [2024-11-09 06:13:55,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:55,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 23 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 4565 [2024-11-09 06:14:02,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:14:02,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:14:02,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:14:02,533 INFO L224 Elim1Store]: Index analysis took 147 ms [2024-11-09 06:14:02,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:02,602 INFO L349 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2024-11-09 06:14:02,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 17 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 18 case distinctions, treesize of input 1311 treesize of output 3447 [2024-11-09 06:14:03,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:14:03,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:14:03,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:14:03,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-09 06:14:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:14:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613588164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [388735858] [2024-11-09 06:14:05,684 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 06:14:05,685 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:14:05,690 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:14:05,696 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:14:05,696 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:14:07,337 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 217 for LOIs [2024-11-09 06:14:07,494 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:15:33,694 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5947#(exists ((|v_#length_90| (Array Int Int)) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_97| Int) (|v_#valid_104| (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1| Int) (|v_#memory_$Pointer$.offset_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~x~0#1.base_117| Int) (|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|) 8) 0)) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_97|) (select |v_#length_90| |v_ULTIMATE.start_main_~x~0#1.base_117|)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|) 8) 1)) (<= 1 |#StackHeapBarrier|) (<= (+ (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_main_~x~0#1.base_117|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_97|) (select (select |v_#memory_$Pointer$.base_92| |v_ULTIMATE.start_main_~x~0#1.base_117|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_97|)))) |v_#memory_$Pointer$.base_92|) (<= 12 (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|)) (= (store |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4))) |v_#memory_int_91|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_97|) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_97|)) |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 8) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_97|)) |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 8))))) (= (store |v_#valid_104| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 1) |#valid|) (not (= (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 0)) (= |#length| (store |v_#length_90| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 12)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_97|) (= |v_#memory_$Pointer$.offset_88| (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~x~0#1.base_117|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_97|) (select (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_97|))))) (= (select |v_#valid_104| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 0) (= |#memory_int| (store |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_97|)) |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 8) 2))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|) 1) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~x~0#1.base_117|) 1) (= (store |v_#memory_int_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_97|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_97| (select (select |v_#memory_int_90| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|))) |v_#memory_int_90|) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1| 0)) (= |v_#memory_$Pointer$.base_93| (store |v_#memory_$Pointer$.base_92| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.base_92| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_117|) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_97|)) |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 8) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_97|)) |v_ULTIMATE.start_main_~x~0#1.base_117|) |v_ULTIMATE.start_main_~x~0#1.offset_97|) 8))))) (= |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_1| 0)))' at error location [2024-11-09 06:15:33,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:15:33,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:15:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 40 [2024-11-09 06:15:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155013951] [2024-11-09 06:15:33,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:15:33,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 06:15:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:15:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 06:15:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3025, Unknown=43, NotChecked=702, Total=4032 [2024-11-09 06:15:33,698 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:15:38,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:39,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:43,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:45,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:50,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:52,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:15:58,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:16:00,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:16:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:16:10,989 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2024-11-09 06:16:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:16:10,989 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 06:16:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:16:10,990 INFO L225 Difference]: With dead ends: 152 [2024-11-09 06:16:10,990 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 06:16:10,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 121.8s TimeCoverageRelationStatistics Valid=410, Invalid=4259, Unknown=47, NotChecked=834, Total=5550 [2024-11-09 06:16:10,993 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 135 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 49 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 604 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:16:10,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 900 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1354 Invalid, 5 Unknown, 604 Unchecked, 24.2s Time] [2024-11-09 06:16:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 06:16:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 143. [2024-11-09 06:16:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 141 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:16:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2024-11-09 06:16:10,997 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 30 [2024-11-09 06:16:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:16:10,998 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2024-11-09 06:16:10,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:16:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2024-11-09 06:16:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:16:10,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:16:10,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:16:11,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:16:11,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:16:11,204 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:16:11,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:16:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1690282975, now seen corresponding path program 1 times [2024-11-09 06:16:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:16:11,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765824406] [2024-11-09 06:16:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:16:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:16:11,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:16:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765824406] [2024-11-09 06:16:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765824406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:16:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:16:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:16:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089005309] [2024-11-09 06:16:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:16:11,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:16:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:16:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:16:11,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:16:11,297 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:16:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:16:11,517 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2024-11-09 06:16:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:16:11,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 06:16:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:16:11,518 INFO L225 Difference]: With dead ends: 142 [2024-11-09 06:16:11,518 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 06:16:11,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:16:11,519 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:16:11,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 177 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:16:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 06:16:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-09 06:16:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 140 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:16:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2024-11-09 06:16:11,523 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 31 [2024-11-09 06:16:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:16:11,524 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2024-11-09 06:16:11,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:16:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2024-11-09 06:16:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:16:11,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:16:11,525 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:16:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 06:16:11,525 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:16:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:16:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1434798087, now seen corresponding path program 1 times [2024-11-09 06:16:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:16:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553367783] [2024-11-09 06:16:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:16:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:16:12,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:16:12,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553367783] [2024-11-09 06:16:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553367783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:16:12,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164828649] [2024-11-09 06:16:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:12,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:16:12,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:16:12,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:16:12,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:16:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:12,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 06:16:12,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:16:12,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:16:12,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:16:12,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:16:12,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:16:12,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:16:12,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:16:12,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:16:13,026 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:16:13,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 06:16:13,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:16:13,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 06:16:13,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:16:13,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:16:13,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:16:13,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:16:13,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:16:13,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:16:13,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:16:13,514 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:16:13,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 06:16:13,554 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 06:16:13,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 06:16:13,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:16:13,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 06:16:13,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:16:13,802 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 06:16:13,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-09 06:16:13,943 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-09 06:16:13,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-09 06:16:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:16:14,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:16:15,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:15,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-09 06:16:15,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2024-11-09 06:16:15,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-09 06:16:15,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:15,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-09 06:16:15,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:16:15,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-09 06:16:15,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-11-09 06:16:15,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:15,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-09 06:16:15,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:16:15,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-09 06:16:15,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:15,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-09 06:16:15,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:15,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 70 [2024-11-09 06:16:15,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2024-11-09 06:16:15,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2024-11-09 06:16:15,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:15,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 86 [2024-11-09 06:16:15,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2024-11-09 06:16:15,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2024-11-09 06:16:15,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:15,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-09 06:16:16,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:16,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 97 [2024-11-09 06:16:17,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:17,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2024-11-09 06:16:17,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 171 [2024-11-09 06:16:17,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2024-11-09 06:16:17,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 152 [2024-11-09 06:16:19,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 720 treesize of output 716 [2024-11-09 06:16:19,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:16:20,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:20,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 333 treesize of output 364 [2024-11-09 06:16:20,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 311 [2024-11-09 06:16:20,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 309 [2024-11-09 06:16:20,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 307 [2024-11-09 06:16:20,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 305 [2024-11-09 06:16:20,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 303 [2024-11-09 06:16:20,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 301 [2024-11-09 06:16:20,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 299 [2024-11-09 06:16:20,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 295 [2024-11-09 06:16:20,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:20,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 298 [2024-11-09 06:16:20,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 285 [2024-11-09 06:16:20,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 283 [2024-11-09 06:16:20,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 279 [2024-11-09 06:16:20,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 275 [2024-11-09 06:16:20,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:20,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 274 [2024-11-09 06:16:20,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 06:16:20,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 06:16:20,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 06:16:20,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:20,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 122 [2024-11-09 06:16:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:16:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164828649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:16:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1131828383] [2024-11-09 06:16:21,336 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 06:16:21,336 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:16:21,336 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:16:21,337 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:16:21,337 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:16:22,831 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:17:23,016 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6799#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#valid_113| (Array Int Int)) (|v_#length_98| (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_127| Int) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_122| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_125| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_int_125| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 (select (select |v_#memory_int_126| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4))) |v_#memory_int_126|) (<= 1 |#StackHeapBarrier|) (= |#memory_int| (store |v_#memory_int_126| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_int_126| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 8) 2))) (= (store |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_main_~x~0#1.base_127|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (select (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|)))) |v_#memory_$Pointer$.offset_117|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (= (store |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|))) |v_#memory_$Pointer$.base_124|) (= |v_#memory_int_125| (store |v_#memory_int_123| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~x~0#1.base_127|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_106| (select (select |v_#memory_int_125| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)))) (= |#length| (store |v_#length_98| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 12)) (= (select |v_#valid_113| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (select |v_#length_98| |v_ULTIMATE.start_main_~x~0#1.base_127|)) (= (store |v_#valid_113| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1) |#valid|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (store (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (+ (select (select (store (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 8) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 8))))) (<= (+ (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_124| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (store (select |v_#memory_$Pointer$.base_124| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_127|) (+ (select (select (store (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 8) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 8))))) (not (= (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_main_~x~0#1.base_127|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 0)) (= (store |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_main_~x~0#1.base_127| (store (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_main_~x~0#1.base_127|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (select (select |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_main_~x~0#1.base_127|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|)))) |v_#memory_$Pointer$.base_123|) (= (select |v_#valid_113| |v_ULTIMATE.start_main_~x~0#1.base_127|) 1))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))' at error location [2024-11-09 06:17:23,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:17:23,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:17:23,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 45 [2024-11-09 06:17:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120769116] [2024-11-09 06:17:23,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:17:23,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 06:17:23,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:17:23,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 06:17:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=4319, Unknown=71, NotChecked=0, Total=4692 [2024-11-09 06:17:23,020 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:17:25,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (not (= .cse0 0))) (.cse5 (< |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse2 (not .cse4)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= .cse0 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (or (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_587 Int) (v_prenex_593 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_arrayElimCell_117 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_101|) (not (= 2 (select v_arrayElimArr_33 8))) (= v_arrayElimCell_117 v_prenex_587) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_593) v_arrayElimCell_117 v_prenex_586) v_prenex_587 v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_101|)) 1)))) .cse2) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (or (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_587 Int) (v_prenex_593 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_arrayElimCell_117 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_587) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_101|) (not (= 2 (select v_arrayElimArr_33 8))) (= v_arrayElimCell_117 v_prenex_587) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_593) v_arrayElimCell_117 v_prenex_586) v_prenex_587 v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_101|)) 1)))) .cse2) (or (not (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) 1)) (and (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_21| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_587 Int) (v_ArrVal_1133 (Array Int Int)) (v_prenex_586 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |v_ULTIMATE.start_main_#t~malloc3#1.base_21| v_prenex_586) v_prenex_587 v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_101|)) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 1) (= v_prenex_587 |v_ULTIMATE.start_main_#t~malloc3#1.base_21|) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_101|) (not (= 2 (select v_arrayElimArr_33 8))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_21|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse3 (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_587 Int) (v_prenex_593 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_arrayElimCell_117 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_593) v_arrayElimCell_117 v_prenex_586) v_prenex_587 v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_101|)) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 1) (= v_prenex_587 |c_ULTIMATE.start_main_~x~0#1.base|) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_101|) (not (= 2 (select v_arrayElimArr_33 8))) (= v_arrayElimCell_117 v_prenex_587)))) (or (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_587 Int) (v_prenex_593 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_arrayElimCell_117 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_593) v_arrayElimCell_117 v_prenex_586) v_prenex_587 v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_101|)) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_101|) (not (= 2 (select v_arrayElimArr_33 8))) (= v_arrayElimCell_117 v_prenex_587))) .cse3) (or (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_587 Int) (v_ArrVal_1133 (Array Int Int)) (v_prenex_586 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_101| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_587) (< |v_ULTIMATE.start_main_~x~0#1.offset_101| 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_101|) (not (= 2 (select v_arrayElimArr_33 8))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_586) v_prenex_587 v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_101|)) 1)))) .cse4) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_21| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_21|) 0)) (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_20| Int) (v_ArrVal_1133 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |v_ULTIMATE.start_main_#t~malloc3#1.base_21| v_ArrVal_1138) |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimArr_30) |c_ULTIMATE.start_main_~head~0#1.base|) 8) 1)) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (not (= 2 (select v_arrayElimArr_30 8))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| |v_ULTIMATE.start_main_#t~malloc3#1.base_21|))))) (or .cse3 (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_20| Int) (v_ArrVal_1134 (Array Int Int)) (v_arrayElimCell_118 Int) (v_arrayElimArr_30 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimCell_118) (not (= 2 (select v_arrayElimArr_30 8))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1134) v_arrayElimCell_118 v_ArrVal_1138) |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimArr_30) |c_ULTIMATE.start_main_~head~0#1.base|) 8) 1))))) (or .cse3 (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_20| Int) (v_ArrVal_1134 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimCell_118) (not (= 2 (select v_arrayElimArr_30 8))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1134) v_arrayElimCell_118 v_ArrVal_1138) |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimArr_30) |c_ULTIMATE.start_main_~head~0#1.base|) 8) 1))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (or .cse5 (and (or (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_20| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimCell_118) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1134) v_arrayElimCell_118 v_ArrVal_1138) |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimArr_30) |c_ULTIMATE.start_main_~head~0#1.base|) 8) 1)) (not (= 2 (select v_arrayElimArr_30 8))))) .cse2) (or .cse2 (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_20| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimCell_118) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1134) v_arrayElimCell_118 v_ArrVal_1138) |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimArr_30) |c_ULTIMATE.start_main_~head~0#1.base|) 8) 1)) (not (= 2 (select v_arrayElimArr_30 8)))))) (or .cse4 (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_20| Int) (v_ArrVal_1133 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_20| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1133 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1133)) (not (= 2 (select v_arrayElimArr_30 8))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1138) |v_ULTIMATE.start_main_#t~malloc6#1.base_20| v_arrayElimArr_30) |c_ULTIMATE.start_main_~head~0#1.base|) 8) 1)))))))))) is different from false [2024-11-09 06:17:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:17:39,928 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2024-11-09 06:17:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-09 06:17:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 06:17:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:17:39,930 INFO L225 Difference]: With dead ends: 234 [2024-11-09 06:17:39,930 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 06:17:39,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2914 ImplicationChecksByTransitivity, 74.9s TimeCoverageRelationStatistics Valid=799, Invalid=8957, Unknown=148, NotChecked=196, Total=10100 [2024-11-09 06:17:39,932 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 394 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 67 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:17:39,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1044 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2116 Invalid, 45 Unknown, 43 Unchecked, 6.5s Time] [2024-11-09 06:17:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 06:17:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 164. [2024-11-09 06:17:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:17:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2024-11-09 06:17:39,941 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 30 [2024-11-09 06:17:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:17:39,942 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2024-11-09 06:17:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:17:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2024-11-09 06:17:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:17:39,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:17:39,942 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:17:39,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:17:40,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 06:17:40,143 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:17:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:17:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1466290863, now seen corresponding path program 1 times [2024-11-09 06:17:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:17:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049229690] [2024-11-09 06:17:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:17:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:17:41,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:17:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049229690] [2024-11-09 06:17:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049229690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:17:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562494988] [2024-11-09 06:17:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:41,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:17:41,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:17:41,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:17:41,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:17:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:42,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 06:17:42,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:17:42,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:17:42,209 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:17:42,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:17:42,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:17:42,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:17:42,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:17:42,645 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:17:42,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 06:17:42,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:17:42,857 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:17:42,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:17:42,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:17:42,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:17:43,127 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:17:43,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:17:43,154 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:17:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 06:17:43,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:17:43,216 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 06:17:43,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 06:17:43,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:17:43,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:17:43,379 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:17:43,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 06:17:43,422 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 06:17:43,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2024-11-09 06:17:43,726 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 06:17:43,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 67 [2024-11-09 06:17:43,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:17:43,958 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 06:17:43,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 69 [2024-11-09 06:17:43,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-11-09 06:17:44,400 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:17:44,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2024-11-09 06:17:44,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:17:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:17:44,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:17:46,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:46,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 126 [2024-11-09 06:17:46,090 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:17:46,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 6 [2024-11-09 06:17:48,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:48,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 386 treesize of output 379 [2024-11-09 06:17:48,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:48,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 370 treesize of output 259 [2024-11-09 06:17:48,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:48,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11584 treesize of output 10687 [2024-11-09 06:17:49,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:49,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129606 treesize of output 128376 [2024-11-09 06:17:49,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:49,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6708 treesize of output 5855 [2024-11-09 06:17:50,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5841 treesize of output 5657 [2024-11-09 06:17:50,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5657 treesize of output 5473 [2024-11-09 06:17:50,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5473 treesize of output 5409 [2024-11-09 06:17:50,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5409 treesize of output 5357 [2024-11-09 06:17:50,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:50,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5357 treesize of output 4998 [2024-11-09 06:17:50,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4989 treesize of output 4957 [2024-11-09 06:17:50,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4957 treesize of output 4612 [2024-11-09 06:17:51,095 INFO L349 Elim1Store]: treesize reduction 4, result has 97.2 percent of original size [2024-11-09 06:17:51,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4610 treesize of output 4728 [2024-11-09 06:17:51,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4620 treesize of output 4558 [2024-11-09 06:17:51,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4515 treesize of output 4511 [2024-11-09 06:17:51,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4511 treesize of output 4499 [2024-11-09 06:17:51,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4499 treesize of output 4487 [2024-11-09 06:17:52,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4538 treesize of output 4492 [2024-11-09 06:17:52,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4451 treesize of output 4431 [2024-11-09 06:17:52,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4431 treesize of output 4395 [2024-11-09 06:18:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562494988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409667545] [2024-11-09 06:18:00,165 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 06:18:00,166 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:18:00,166 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:18:00,166 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:18:00,166 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:18:01,742 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:18:29,344 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7285#true' at error location [2024-11-09 06:18:29,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:18:29,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:18:29,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 44 [2024-11-09 06:18:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588294019] [2024-11-09 06:18:29,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:18:29,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 06:18:29,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:18:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 06:18:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=3979, Unknown=20, NotChecked=0, Total=4290 [2024-11-09 06:18:29,348 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 45 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:32,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:18:34,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:18:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:39,828 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2024-11-09 06:18:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 06:18:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 45 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 06:18:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:39,830 INFO L225 Difference]: With dead ends: 172 [2024-11-09 06:18:39,830 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 06:18:39,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=559, Invalid=5901, Unknown=20, NotChecked=0, Total=6480 [2024-11-09 06:18:39,832 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 264 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 70 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:39,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1010 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1912 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2024-11-09 06:18:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 06:18:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 160. [2024-11-09 06:18:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 158 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2024-11-09 06:18:39,837 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 30 [2024-11-09 06:18:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:39,838 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2024-11-09 06:18:39,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 45 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2024-11-09 06:18:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:18:39,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:39,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:39,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:18:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 06:18:40,040 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:18:40,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1690188995, now seen corresponding path program 1 times [2024-11-09 06:18:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:18:40,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144819139] [2024-11-09 06:18:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:40,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:18:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144819139] [2024-11-09 06:18:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144819139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:40,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:18:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846128602] [2024-11-09 06:18:40,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:40,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:18:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:18:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:18:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:18:40,651 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:41,292 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2024-11-09 06:18:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:18:41,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 06:18:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:41,293 INFO L225 Difference]: With dead ends: 187 [2024-11-09 06:18:41,293 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 06:18:41,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:18:41,294 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 47 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:41,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:18:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 06:18:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 169. [2024-11-09 06:18:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 167 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2024-11-09 06:18:41,299 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 31 [2024-11-09 06:18:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:41,300 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2024-11-09 06:18:41,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2024-11-09 06:18:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:18:41,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:41,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:41,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 06:18:41,301 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 06:18:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1588265161, now seen corresponding path program 1 times [2024-11-09 06:18:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:18:41,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555967650] [2024-11-09 06:18:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:42,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:18:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555967650] [2024-11-09 06:18:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555967650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751795884] [2024-11-09 06:18:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:42,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:42,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:18:42,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:18:42,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999bfbb1-6146-42ce-ac7b-39a81ced69ab/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:18:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:42,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 06:18:42,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:42,307 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:18:42,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 06:18:42,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:18:42,580 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:18:42,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 06:18:42,728 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:18:42,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 06:18:43,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:18:43,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-11-09 06:18:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:43,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:43,493 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1439))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1440)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1439))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1440)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2024-11-09 06:18:43,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1439))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1440)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1439))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1440)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-09 06:18:43,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:18:43,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 06:18:43,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:18:43,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2024-11-09 06:18:43,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 163 [2024-11-09 06:18:43,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:18:43,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-09 06:18:43,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:18:43,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-09 06:18:43,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:18:43,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2024-11-09 06:18:44,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2024-11-09 06:18:44,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:18:44,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2024-11-09 06:18:44,210 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 06:18:44,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-09 06:18:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751795884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [953644284] [2024-11-09 06:18:44,243 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 06:18:44,243 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:18:44,244 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:18:44,244 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:18:44,244 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:18:44,932 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:20:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [953644284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:20,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:20:20,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [12, 11, 12] total 46 [2024-11-09 06:20:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679346234] [2024-11-09 06:20:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:20,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 06:20:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:20:20,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 06:20:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1572, Unknown=51, NotChecked=170, Total=2070 [2024-11-09 06:20:20,871 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:24,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:27,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:29,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:31,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:33,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:36,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:38,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:40,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:20:43,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:23:56,074 WARN L286 SmtUtils]: Spent 2.95m on a formula simplification. DAG size of input: 253 DAG size of output: 236 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:23:58,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:00,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:01,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:03,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:05,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:07,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:09,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:11,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:12,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:14,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:15,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:17,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]