./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:11:47,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:11:47,665 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 19:11:47,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:11:47,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:11:47,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:11:47,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:11:47,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:11:47,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:11:47,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:11:47,696 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:11:47,697 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:11:47,697 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:11:47,698 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:11:47,698 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:11:47,699 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:11:47,699 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:11:47,700 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:11:47,700 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:11:47,701 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:11:47,702 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:11:47,702 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:11:47,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 19:11:47,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 19:11:47,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:11:47,704 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:11:47,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:11:47,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:11:47,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:11:47,706 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 19:11:47,706 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 19:11:47,707 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 19:11:47,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:11:47,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 19:11:47,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:11:47,708 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:11:47,708 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:11:47,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:11:47,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:11:47,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:11:47,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:11:47,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:11:47,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:11:47,710 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:11:47,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:11:47,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:11:47,710 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:11:47,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:11:47,710 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_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2023-12-02 19:11:47,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:11:47,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:11:47,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:11:47,941 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:11:47,941 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:11:47,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2023-12-02 19:11:50,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:11:50,946 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:11:50,947 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2023-12-02 19:11:50,962 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/data/c47426230/cb04d9da51594493b5b365619d1aae84/FLAG37298e5c8 [2023-12-02 19:11:50,976 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/data/c47426230/cb04d9da51594493b5b365619d1aae84 [2023-12-02 19:11:50,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:11:50,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:11:50,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:11:50,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:11:50,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:11:50,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:11:50" (1/1) ... [2023-12-02 19:11:50,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f61894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:50, skipping insertion in model container [2023-12-02 19:11:50,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:11:50" (1/1) ... [2023-12-02 19:11:51,041 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:11:51,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:11:51,374 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:11:51,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:11:51,455 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:11:51,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51 WrapperNode [2023-12-02 19:11:51,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:11:51,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:11:51,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:11:51,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:11:51,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,508 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2023-12-02 19:11:51,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:11:51,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:11:51,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:11:51,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:11:51,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:11:51,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:11:51,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:11:51,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:11:51,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (1/1) ... [2023-12-02 19:11:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:11:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:11:51,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:11:51,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:11:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:11:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:11:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:11:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:11:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:11:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:11:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:11:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:11:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:11:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:11:51,706 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:11:51,708 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:11:52,111 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:11:52,170 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:11:52,170 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 19:11:52,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:11:52 BoogieIcfgContainer [2023-12-02 19:11:52,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:11:52,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:11:52,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:11:52,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:11:52,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:11:50" (1/3) ... [2023-12-02 19:11:52,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfea24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:11:52, skipping insertion in model container [2023-12-02 19:11:52,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:51" (2/3) ... [2023-12-02 19:11:52,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfea24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:11:52, skipping insertion in model container [2023-12-02 19:11:52,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:11:52" (3/3) ... [2023-12-02 19:11:52,182 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2023-12-02 19:11:52,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:11:52,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2023-12-02 19:11:52,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:11:52,246 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76146b65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:11:52,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2023-12-02 19:11:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 58 states have (on average 2.4827586206896552) internal successors, (144), 128 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 19:11:52,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:52,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 19:11:52,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:52,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 8988236, now seen corresponding path program 1 times [2023-12-02 19:11:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716620932] [2023-12-02 19:11:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:52,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:52,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716620932] [2023-12-02 19:11:52,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716620932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:52,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:52,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:11:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329490826] [2023-12-02 19:11:52,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:52,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 19:11:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 19:11:52,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:11:52,440 INFO L87 Difference]: Start difference. First operand has 129 states, 58 states have (on average 2.4827586206896552) internal successors, (144), 128 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:52,503 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2023-12-02 19:11:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 19:11:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-02 19:11:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:52,514 INFO L225 Difference]: With dead ends: 129 [2023-12-02 19:11:52,514 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 19:11:52,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:11:52,519 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:52,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:11:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 19:11:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-12-02 19:11:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 58 states have (on average 2.4310344827586206) internal successors, (141), 127 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2023-12-02 19:11:52,561 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 4 [2023-12-02 19:11:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:52,561 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2023-12-02 19:11:52,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2023-12-02 19:11:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 19:11:52,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:52,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 19:11:52,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:11:52,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:52,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 9179498, now seen corresponding path program 1 times [2023-12-02 19:11:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149306623] [2023-12-02 19:11:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:52,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149306623] [2023-12-02 19:11:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149306623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:11:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847792388] [2023-12-02 19:11:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:52,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:11:52,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:11:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:52,658 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:52,825 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2023-12-02 19:11:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:11:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-02 19:11:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:52,828 INFO L225 Difference]: With dead ends: 151 [2023-12-02 19:11:52,829 INFO L226 Difference]: Without dead ends: 151 [2023-12-02 19:11:52,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:52,830 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:52,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 140 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-02 19:11:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2023-12-02 19:11:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 125 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2023-12-02 19:11:52,843 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 4 [2023-12-02 19:11:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:52,843 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2023-12-02 19:11:52,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2023-12-02 19:11:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 19:11:52,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:52,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 19:11:52,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:11:52,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:52,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 9179499, now seen corresponding path program 1 times [2023-12-02 19:11:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797032036] [2023-12-02 19:11:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:52,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797032036] [2023-12-02 19:11:52,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797032036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:52,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:52,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:11:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588229383] [2023-12-02 19:11:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:52,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:11:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:52,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:11:52,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:52,948 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:53,082 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2023-12-02 19:11:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:11:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-02 19:11:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:53,085 INFO L225 Difference]: With dead ends: 122 [2023-12-02 19:11:53,085 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 19:11:53,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,087 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:53,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 19:11:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-12-02 19:11:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.278688524590164) internal successors, (139), 121 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2023-12-02 19:11:53,097 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 4 [2023-12-02 19:11:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:53,097 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2023-12-02 19:11:53,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2023-12-02 19:11:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 19:11:53,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:53,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 19:11:53,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:11:53,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:53,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:53,099 INFO L85 PathProgramCache]: Analyzing trace with hash 284313775, now seen corresponding path program 1 times [2023-12-02 19:11:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:53,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836727918] [2023-12-02 19:11:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:53,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836727918] [2023-12-02 19:11:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836727918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:53,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:53,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:11:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008552362] [2023-12-02 19:11:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:53,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:11:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:11:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,127 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:53,256 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2023-12-02 19:11:53,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:11:53,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 19:11:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:53,258 INFO L225 Difference]: With dead ends: 163 [2023-12-02 19:11:53,258 INFO L226 Difference]: Without dead ends: 162 [2023-12-02 19:11:53,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,260 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:53,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 159 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-02 19:11:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 125. [2023-12-02 19:11:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.234375) internal successors, (143), 124 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2023-12-02 19:11:53,270 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 5 [2023-12-02 19:11:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:53,271 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2023-12-02 19:11:53,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2023-12-02 19:11:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 19:11:53,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:53,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 19:11:53,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 19:11:53,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:53,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash 284313679, now seen corresponding path program 1 times [2023-12-02 19:11:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:53,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208674964] [2023-12-02 19:11:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:53,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:53,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208674964] [2023-12-02 19:11:53,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208674964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:53,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:53,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:11:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651969986] [2023-12-02 19:11:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:53,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:11:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:53,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:11:53,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,306 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:53,405 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2023-12-02 19:11:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:11:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 19:11:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:53,406 INFO L225 Difference]: With dead ends: 136 [2023-12-02 19:11:53,406 INFO L226 Difference]: Without dead ends: 135 [2023-12-02 19:11:53,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,408 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:53,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-02 19:11:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-12-02 19:11:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 2.125) internal successors, (153), 132 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2023-12-02 19:11:53,417 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 5 [2023-12-02 19:11:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:53,417 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2023-12-02 19:11:53,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2023-12-02 19:11:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 19:11:53,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:53,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:53,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 19:11:53,419 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:53,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1574423178, now seen corresponding path program 1 times [2023-12-02 19:11:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:53,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887908631] [2023-12-02 19:11:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:53,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:53,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887908631] [2023-12-02 19:11:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887908631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:53,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:11:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907167989] [2023-12-02 19:11:53,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:53,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:11:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:53,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:11:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:11:53,483 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:53,603 INFO L93 Difference]: Finished difference Result 251 states and 282 transitions. [2023-12-02 19:11:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:11:53,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 19:11:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:53,605 INFO L225 Difference]: With dead ends: 251 [2023-12-02 19:11:53,605 INFO L226 Difference]: Without dead ends: 251 [2023-12-02 19:11:53,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:11:53,607 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 126 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:53,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 326 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-02 19:11:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 136. [2023-12-02 19:11:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 2.04) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 153 transitions. [2023-12-02 19:11:53,617 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 153 transitions. Word has length 10 [2023-12-02 19:11:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:53,617 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 153 transitions. [2023-12-02 19:11:53,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2023-12-02 19:11:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:11:53,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:53,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:53,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 19:11:53,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:53,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 972049197, now seen corresponding path program 1 times [2023-12-02 19:11:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138561442] [2023-12-02 19:11:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:53,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:53,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138561442] [2023-12-02 19:11:53,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138561442] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:53,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:53,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:11:53,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594459843] [2023-12-02 19:11:53,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:53,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:11:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:11:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,710 INFO L87 Difference]: Start difference. First operand 136 states and 153 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:53,807 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2023-12-02 19:11:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:11:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:11:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:53,809 INFO L225 Difference]: With dead ends: 132 [2023-12-02 19:11:53,809 INFO L226 Difference]: Without dead ends: 132 [2023-12-02 19:11:53,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,810 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:53,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 146 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-02 19:11:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-12-02 19:11:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 131 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2023-12-02 19:11:53,817 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 13 [2023-12-02 19:11:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:53,817 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2023-12-02 19:11:53,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2023-12-02 19:11:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:11:53,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:53,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:53,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 19:11:53,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:53,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:53,819 INFO L85 PathProgramCache]: Analyzing trace with hash 972049198, now seen corresponding path program 1 times [2023-12-02 19:11:53,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:53,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118555952] [2023-12-02 19:11:53,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:53,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118555952] [2023-12-02 19:11:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118555952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:53,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:11:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175142356] [2023-12-02 19:11:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:11:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:11:53,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:53,934 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:54,035 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2023-12-02 19:11:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:11:54,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:11:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:54,036 INFO L225 Difference]: With dead ends: 129 [2023-12-02 19:11:54,036 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 19:11:54,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:11:54,038 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:54,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 19:11:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-12-02 19:11:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 128 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2023-12-02 19:11:54,044 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 13 [2023-12-02 19:11:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:54,044 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2023-12-02 19:11:54,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2023-12-02 19:11:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:11:54,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:54,046 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:54,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 19:11:54,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:54,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 368432996, now seen corresponding path program 1 times [2023-12-02 19:11:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996589854] [2023-12-02 19:11:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:54,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996589854] [2023-12-02 19:11:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996589854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:11:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115805793] [2023-12-02 19:11:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:54,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:11:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:11:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:11:54,121 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:54,276 INFO L93 Difference]: Finished difference Result 221 states and 248 transitions. [2023-12-02 19:11:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:11:54,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 19:11:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:54,279 INFO L225 Difference]: With dead ends: 221 [2023-12-02 19:11:54,279 INFO L226 Difference]: Without dead ends: 221 [2023-12-02 19:11:54,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:11:54,280 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 126 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:54,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 216 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-02 19:11:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 129. [2023-12-02 19:11:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.92) internal successors, (144), 128 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2023-12-02 19:11:54,285 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 18 [2023-12-02 19:11:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:54,285 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2023-12-02 19:11:54,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2023-12-02 19:11:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:11:54,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:54,287 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:54,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 19:11:54,287 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:54,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash 368432900, now seen corresponding path program 1 times [2023-12-02 19:11:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260619375] [2023-12-02 19:11:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:54,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260619375] [2023-12-02 19:11:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260619375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:54,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:54,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:11:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119797913] [2023-12-02 19:11:54,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:54,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:11:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:54,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:11:54,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:11:54,374 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:54,533 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2023-12-02 19:11:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:11:54,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 19:11:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:54,534 INFO L225 Difference]: With dead ends: 123 [2023-12-02 19:11:54,535 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 19:11:54,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:11:54,535 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 43 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:54,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 146 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:11:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 19:11:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-12-02 19:11:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 121 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2023-12-02 19:11:54,540 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 18 [2023-12-02 19:11:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:54,540 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2023-12-02 19:11:54,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2023-12-02 19:11:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:11:54,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:54,541 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:54,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 19:11:54,542 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:54,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash 368432901, now seen corresponding path program 1 times [2023-12-02 19:11:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886336473] [2023-12-02 19:11:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:54,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:54,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886336473] [2023-12-02 19:11:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886336473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:54,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:11:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583042179] [2023-12-02 19:11:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:54,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:11:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:11:54,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:11:54,708 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:54,928 INFO L93 Difference]: Finished difference Result 197 states and 223 transitions. [2023-12-02 19:11:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:11:54,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 19:11:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:54,930 INFO L225 Difference]: With dead ends: 197 [2023-12-02 19:11:54,930 INFO L226 Difference]: Without dead ends: 197 [2023-12-02 19:11:54,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:11:54,931 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 100 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:54,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 146 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:11:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-02 19:11:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 150. [2023-12-02 19:11:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 106 states have (on average 1.8679245283018868) internal successors, (198), 149 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 198 transitions. [2023-12-02 19:11:54,937 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 198 transitions. Word has length 18 [2023-12-02 19:11:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:54,937 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 198 transitions. [2023-12-02 19:11:54,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 198 transitions. [2023-12-02 19:11:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:11:54,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:54,938 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:54,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 19:11:54,939 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:54,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash -376655476, now seen corresponding path program 1 times [2023-12-02 19:11:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865266312] [2023-12-02 19:11:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:55,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865266312] [2023-12-02 19:11:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865266312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:55,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:11:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437746305] [2023-12-02 19:11:55,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:55,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:11:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:11:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:11:55,037 INFO L87 Difference]: Start difference. First operand 150 states and 198 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:55,208 INFO L93 Difference]: Finished difference Result 197 states and 223 transitions. [2023-12-02 19:11:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:11:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:11:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:55,210 INFO L225 Difference]: With dead ends: 197 [2023-12-02 19:11:55,210 INFO L226 Difference]: Without dead ends: 197 [2023-12-02 19:11:55,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:11:55,211 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 217 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:55,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 248 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-02 19:11:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 151. [2023-12-02 19:11:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.8598130841121496) internal successors, (199), 150 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2023-12-02 19:11:55,216 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 22 [2023-12-02 19:11:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:55,217 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2023-12-02 19:11:55,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2023-12-02 19:11:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:11:55,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:55,218 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:55,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 19:11:55,218 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:55,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -376609598, now seen corresponding path program 1 times [2023-12-02 19:11:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058119658] [2023-12-02 19:11:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:55,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058119658] [2023-12-02 19:11:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058119658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:55,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:11:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972882119] [2023-12-02 19:11:55,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:55,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:11:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:55,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:11:55,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:11:55,554 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:55,739 INFO L93 Difference]: Finished difference Result 182 states and 233 transitions. [2023-12-02 19:11:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:11:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:11:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:55,740 INFO L225 Difference]: With dead ends: 182 [2023-12-02 19:11:55,741 INFO L226 Difference]: Without dead ends: 182 [2023-12-02 19:11:55,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:11:55,741 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 29 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:55,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 269 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:11:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-02 19:11:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 157. [2023-12-02 19:11:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 113 states have (on average 1.823008849557522) internal successors, (206), 156 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 206 transitions. [2023-12-02 19:11:55,747 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 206 transitions. Word has length 22 [2023-12-02 19:11:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:55,748 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 206 transitions. [2023-12-02 19:11:55,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 206 transitions. [2023-12-02 19:11:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:11:55,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:55,749 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:55,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 19:11:55,750 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:55,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1806495496, now seen corresponding path program 1 times [2023-12-02 19:11:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080029103] [2023-12-02 19:11:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:56,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080029103] [2023-12-02 19:11:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080029103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:56,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:56,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 19:11:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040222282] [2023-12-02 19:11:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:56,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:11:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:56,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:11:56,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:11:56,033 INFO L87 Difference]: Start difference. First operand 157 states and 206 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:56,345 INFO L93 Difference]: Finished difference Result 302 states and 367 transitions. [2023-12-02 19:11:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:11:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-12-02 19:11:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:56,348 INFO L225 Difference]: With dead ends: 302 [2023-12-02 19:11:56,348 INFO L226 Difference]: Without dead ends: 302 [2023-12-02 19:11:56,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-12-02 19:11:56,349 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 303 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:56,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 270 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:11:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-02 19:11:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 196. [2023-12-02 19:11:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 152 states have (on average 1.7763157894736843) internal successors, (270), 195 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 270 transitions. [2023-12-02 19:11:56,358 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 270 transitions. Word has length 25 [2023-12-02 19:11:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:56,358 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 270 transitions. [2023-12-02 19:11:56,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 270 transitions. [2023-12-02 19:11:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:11:56,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:56,360 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 19:11:56,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:56,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1806493571, now seen corresponding path program 1 times [2023-12-02 19:11:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828334618] [2023-12-02 19:11:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:56,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:56,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828334618] [2023-12-02 19:11:56,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828334618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:56,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 19:11:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843616661] [2023-12-02 19:11:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:56,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:11:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:11:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:11:56,835 INFO L87 Difference]: Start difference. First operand 196 states and 270 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:57,391 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2023-12-02 19:11:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:11:57,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-12-02 19:11:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:57,393 INFO L225 Difference]: With dead ends: 257 [2023-12-02 19:11:57,394 INFO L226 Difference]: Without dead ends: 257 [2023-12-02 19:11:57,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:11:57,395 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 186 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:57,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 323 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:11:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-02 19:11:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 197. [2023-12-02 19:11:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.7777777777777777) internal successors, (272), 196 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 272 transitions. [2023-12-02 19:11:57,417 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 272 transitions. Word has length 25 [2023-12-02 19:11:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:57,417 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 272 transitions. [2023-12-02 19:11:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 272 transitions. [2023-12-02 19:11:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:11:57,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:57,418 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:57,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 19:11:57,419 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:57,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1806493572, now seen corresponding path program 1 times [2023-12-02 19:11:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732936531] [2023-12-02 19:11:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:58,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732936531] [2023-12-02 19:11:58,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732936531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:58,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:58,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 19:11:58,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506166755] [2023-12-02 19:11:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:58,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:11:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:11:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:11:58,016 INFO L87 Difference]: Start difference. First operand 197 states and 272 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:58,550 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2023-12-02 19:11:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:11:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-12-02 19:11:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:58,553 INFO L225 Difference]: With dead ends: 296 [2023-12-02 19:11:58,553 INFO L226 Difference]: Without dead ends: 296 [2023-12-02 19:11:58,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:11:58,554 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 247 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:58,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 244 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:11:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-02 19:11:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 199. [2023-12-02 19:11:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.761290322580645) internal successors, (273), 198 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 273 transitions. [2023-12-02 19:11:58,562 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 273 transitions. Word has length 25 [2023-12-02 19:11:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:58,562 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 273 transitions. [2023-12-02 19:11:58,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 273 transitions. [2023-12-02 19:11:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:11:58,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:58,564 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:58,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 19:11:58,564 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:58,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash 166727686, now seen corresponding path program 1 times [2023-12-02 19:11:58,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:58,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518095870] [2023-12-02 19:11:58,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:11:58,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:58,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518095870] [2023-12-02 19:11:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518095870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:58,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:58,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:11:58,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860062184] [2023-12-02 19:11:58,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:11:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:11:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:11:58,636 INFO L87 Difference]: Start difference. First operand 199 states and 273 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:58,828 INFO L93 Difference]: Finished difference Result 261 states and 354 transitions. [2023-12-02 19:11:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:11:58,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:11:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:58,831 INFO L225 Difference]: With dead ends: 261 [2023-12-02 19:11:58,831 INFO L226 Difference]: Without dead ends: 261 [2023-12-02 19:11:58,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:11:58,832 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 78 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:58,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 191 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:11:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-02 19:11:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 201. [2023-12-02 19:11:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 161 states have (on average 1.7453416149068324) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 281 transitions. [2023-12-02 19:11:58,840 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 281 transitions. Word has length 26 [2023-12-02 19:11:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:58,840 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 281 transitions. [2023-12-02 19:11:58,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:11:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 281 transitions. [2023-12-02 19:11:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:11:58,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:58,841 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:58,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 19:11:58,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:11:58,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 166727687, now seen corresponding path program 1 times [2023-12-02 19:11:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:58,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912765986] [2023-12-02 19:11:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:59,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:59,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912765986] [2023-12-02 19:11:59,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912765986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:59,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:59,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 19:11:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970859608] [2023-12-02 19:11:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:59,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:11:59,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:11:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:11:59,509 INFO L87 Difference]: Start difference. First operand 201 states and 281 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:12:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:12:00,215 INFO L93 Difference]: Finished difference Result 305 states and 379 transitions. [2023-12-02 19:12:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:12:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:12:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:12:00,218 INFO L225 Difference]: With dead ends: 305 [2023-12-02 19:12:00,218 INFO L226 Difference]: Without dead ends: 305 [2023-12-02 19:12:00,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-12-02 19:12:00,219 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 339 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:12:00,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 222 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:12:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-02 19:12:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 204. [2023-12-02 19:12:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.7378048780487805) internal successors, (285), 203 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:12:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2023-12-02 19:12:00,227 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 26 [2023-12-02 19:12:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:12:00,228 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2023-12-02 19:12:00,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:12:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2023-12-02 19:12:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:12:00,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:12:00,229 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:12:00,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 19:12:00,229 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:12:00,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:12:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2004019505, now seen corresponding path program 1 times [2023-12-02 19:12:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:12:00,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110402134] [2023-12-02 19:12:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:12:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:12:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:12:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:12:00,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:12:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110402134] [2023-12-02 19:12:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110402134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:12:00,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:12:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:12:00,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207840921] [2023-12-02 19:12:00,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:12:00,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:12:00,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:12:00,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:12:00,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:12:00,290 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 3 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) [2023-12-02 19:12:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:12:00,335 INFO L93 Difference]: Finished difference Result 205 states and 286 transitions. [2023-12-02 19:12:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:12:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 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 29 [2023-12-02 19:12:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:12:00,337 INFO L225 Difference]: With dead ends: 205 [2023-12-02 19:12:00,338 INFO L226 Difference]: Without dead ends: 205 [2023-12-02 19:12:00,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:12:00,339 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:12:00,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:12:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-02 19:12:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-12-02 19:12:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.7333333333333334) internal successors, (286), 204 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:12:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2023-12-02 19:12:00,345 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 29 [2023-12-02 19:12:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:12:00,345 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2023-12-02 19:12:00,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2023-12-02 19:12:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2023-12-02 19:12:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 19:12:00,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:12:00,346 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:12:00,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 19:12:00,347 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:12:00,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:12:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1994918567, now seen corresponding path program 1 times [2023-12-02 19:12:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:12:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681771791] [2023-12-02 19:12:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:12:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:12:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:12:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:12:00,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:12:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681771791] [2023-12-02 19:12:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681771791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:12:00,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:12:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 19:12:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286053773] [2023-12-02 19:12:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:12:00,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 19:12:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:12:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 19:12:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:12:00,677 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:12:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:12:01,161 INFO L93 Difference]: Finished difference Result 340 states and 416 transitions. [2023-12-02 19:12:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 19:12:01,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 19:12:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:12:01,164 INFO L225 Difference]: With dead ends: 340 [2023-12-02 19:12:01,164 INFO L226 Difference]: Without dead ends: 340 [2023-12-02 19:12:01,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-12-02 19:12:01,165 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 370 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:12:01,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 549 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:12:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-12-02 19:12:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 207. [2023-12-02 19:12:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.7305389221556886) internal successors, (289), 206 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:12:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 289 transitions. [2023-12-02 19:12:01,173 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 289 transitions. Word has length 30 [2023-12-02 19:12:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:12:01,173 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 289 transitions. [2023-12-02 19:12:01,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:12:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 289 transitions. [2023-12-02 19:12:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 19:12:01,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:12:01,174 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:12:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 19:12:01,175 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:12:01,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:12:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1995071659, now seen corresponding path program 1 times [2023-12-02 19:12:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:12:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106460566] [2023-12-02 19:12:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:12:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:12:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:12:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:12:02,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:12:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106460566] [2023-12-02 19:12:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106460566] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:12:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884435712] [2023-12-02 19:12:02,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:12:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:12:02,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:12:02,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:12:02,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:12:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:12:02,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 19:12:02,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:12:02,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:12:02,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-02 19:12:02,455 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:12:02,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:12:02,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-12-02 19:12:02,615 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 39 treesize of output 28 [2023-12-02 19:12:02,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:12:02,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:12:02,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:02,820 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 48 treesize of output 38 [2023-12-02 19:12:02,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:02,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-12-02 19:12:03,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-12-02 19:12:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:12:03,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:12:03,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2023-12-02 19:12:03,431 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 129 treesize of output 117 [2023-12-02 19:12:03,650 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse11 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (or (let ((.cse6 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse2 (not .cse0)) (.cse3 (not .cse11)) (.cse4 (forall ((v_ArrVal_644 (Array Int Int))) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6)))) (.cse8 (forall ((v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (or (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_644) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))) (< v_arrayElimCell_11 0)))) (.cse1 (forall ((v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_644) v_arrayElimCell_10))) (or (< 1 (select .cse12 (+ 4 v_arrayElimCell_11))) (< 1 (select .cse12 .cse6)) (< v_arrayElimCell_11 0)))))) (and (or .cse0 .cse1) (or .cse2 .cse3 .cse4) (forall ((v_arrayElimCell_11 Int)) (or (forall ((v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_10 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_644))) (let ((.cse5 (select .cse7 v_arrayElimCell_10))) (or (< 1 (select .cse5 (+ 4 v_arrayElimCell_11))) (< 1 (select .cse5 .cse6)) (< 1 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) .cse6)))))) (< v_arrayElimCell_11 0))) (or .cse0 .cse8) (or .cse2 .cse3 (and (forall ((v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_644))) (let ((.cse9 (select .cse10 v_arrayElimCell_10))) (or (< 1 (select .cse9 (+ 4 v_arrayElimCell_11))) (< 1 (select .cse9 .cse6)) (< 1 (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) .cse6)))))) .cse4)) (or .cse8 .cse11) (or .cse1 .cse11)))) (and .cse0 (<= (+ |c_ULTIMATE.start_main_~item~0#1.offset| 1) 0) .cse11))) is different from false [2023-12-02 19:12:04,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:04,511 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 26 treesize of output 27 [2023-12-02 19:12:04,516 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 40 treesize of output 28 [2023-12-02 19:12:04,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:12:04,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:04,538 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 79 treesize of output 51 [2023-12-02 19:12:04,542 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:12:04,572 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2023-12-02 19:12:04,572 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 74 treesize of output 66 [2023-12-02 19:12:04,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:04,595 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 23 treesize of output 23 [2023-12-02 19:12:04,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:04,647 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 79 treesize of output 51 [2023-12-02 19:12:04,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:12:04,680 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2023-12-02 19:12:04,681 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 74 treesize of output 66 [2023-12-02 19:12:04,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:04,705 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 23 treesize of output 23 [2023-12-02 19:12:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:12:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884435712] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:12:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1607520312] [2023-12-02 19:12:04,939 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-12-02 19:12:04,939 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:12:04,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:12:04,949 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:12:04,950 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:12:06,282 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:12:23,081 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 233 DAG size of output: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:13:05,425 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7768#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~item~0#1.base| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= |ULTIMATE.start_main_~c1~0#1| 1) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0) (exists ((|v_#valid_127| (Array Int Int))) (and (= (store |v_#valid_127| |ULTIMATE.start_main_~data~0#1.base| 0) |#valid|) (= (select |v_#valid_127| |ULTIMATE.start_main_~data~0#1.base|) 1))) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1.base|)) (and (<= (+ |ULTIMATE.start_main_~item2~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~item2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1) (<= 0 (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 1))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-12-02 19:13:05,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:13:05,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:13:05,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2023-12-02 19:13:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351525778] [2023-12-02 19:13:05,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:13:05,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 19:13:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:13:05,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 19:13:05,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2837, Unknown=28, NotChecked=110, Total=3306 [2023-12-02 19:13:05,430 INFO L87 Difference]: Start difference. First operand 207 states and 289 transitions. Second operand has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:13:13,004 INFO L93 Difference]: Finished difference Result 301 states and 397 transitions. [2023-12-02 19:13:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 19:13:13,005 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 19:13:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:13:13,007 INFO L225 Difference]: With dead ends: 301 [2023-12-02 19:13:13,007 INFO L226 Difference]: Without dead ends: 301 [2023-12-02 19:13:13,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=741, Invalid=5397, Unknown=28, NotChecked=154, Total=6320 [2023-12-02 19:13:13,010 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 514 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 69 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:13:13,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1221 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2330 Invalid, 10 Unknown, 225 Unchecked, 4.8s Time] [2023-12-02 19:13:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-12-02 19:13:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 215. [2023-12-02 19:13:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 175 states have (on average 1.697142857142857) internal successors, (297), 214 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 297 transitions. [2023-12-02 19:13:13,018 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 297 transitions. Word has length 30 [2023-12-02 19:13:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:13:13,018 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 297 transitions. [2023-12-02 19:13:13,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 297 transitions. [2023-12-02 19:13:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:13:13,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:13:13,019 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:13:13,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:13:13,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 19:13:13,220 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:13:13,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:13:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1712942581, now seen corresponding path program 1 times [2023-12-02 19:13:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:13:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988794801] [2023-12-02 19:13:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:13:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:13:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:13:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:13:14,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:13:14,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988794801] [2023-12-02 19:13:14,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988794801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:13:14,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:13:14,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-02 19:13:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148063156] [2023-12-02 19:13:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:13:14,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:13:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:13:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:13:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:13:14,237 INFO L87 Difference]: Start difference. First operand 215 states and 297 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:13:16,103 INFO L93 Difference]: Finished difference Result 270 states and 357 transitions. [2023-12-02 19:13:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:13:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:13:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:13:16,105 INFO L225 Difference]: With dead ends: 270 [2023-12-02 19:13:16,106 INFO L226 Difference]: Without dead ends: 270 [2023-12-02 19:13:16,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2023-12-02 19:13:16,107 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 172 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:13:16,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 440 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 19:13:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-02 19:13:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 217. [2023-12-02 19:13:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.689265536723164) internal successors, (299), 216 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 299 transitions. [2023-12-02 19:13:16,113 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 299 transitions. Word has length 31 [2023-12-02 19:13:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:13:16,113 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 299 transitions. [2023-12-02 19:13:16,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 299 transitions. [2023-12-02 19:13:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:13:16,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:13:16,114 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:13:16,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 19:13:16,114 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:13:16,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:13:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1712933703, now seen corresponding path program 1 times [2023-12-02 19:13:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:13:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055518806] [2023-12-02 19:13:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:13:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:13:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:13:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:13:16,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:13:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055518806] [2023-12-02 19:13:16,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055518806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:13:16,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:13:16,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 19:13:16,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286997348] [2023-12-02 19:13:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:13:16,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:13:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:13:16,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:13:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:13:16,461 INFO L87 Difference]: Start difference. First operand 217 states and 299 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:13:17,173 INFO L93 Difference]: Finished difference Result 244 states and 328 transitions. [2023-12-02 19:13:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:13:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:13:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:13:17,176 INFO L225 Difference]: With dead ends: 244 [2023-12-02 19:13:17,176 INFO L226 Difference]: Without dead ends: 244 [2023-12-02 19:13:17,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:13:17,177 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 54 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:13:17,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 294 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:13:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-02 19:13:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 219. [2023-12-02 19:13:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 179 states have (on average 1.681564245810056) internal successors, (301), 218 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 301 transitions. [2023-12-02 19:13:17,183 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 301 transitions. Word has length 31 [2023-12-02 19:13:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:13:17,183 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 301 transitions. [2023-12-02 19:13:17,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:13:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 301 transitions. [2023-12-02 19:13:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 19:13:17,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:13:17,184 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:13:17,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 19:13:17,185 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:13:17,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:13:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1501773457, now seen corresponding path program 1 times [2023-12-02 19:13:17,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:13:17,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894381864] [2023-12-02 19:13:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:13:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:13:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:13:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:13:17,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:13:17,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894381864] [2023-12-02 19:13:17,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894381864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:13:17,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458961690] [2023-12-02 19:13:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:13:17,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:13:17,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:13:17,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:13:17,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:13:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:13:17,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 19:13:17,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:13:18,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:13:18,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:13:18,302 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 46 treesize of output 36 [2023-12-02 19:13:18,823 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~item2~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~data~0#1.base| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~item2~0#1.base| 1) |ULTIMATE.start_main_~data~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base| 0) |ULTIMATE.start_main_~item2~0#1.base| 0)))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~item2~0#1.base|) 0))) is different from true [2023-12-02 19:13:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 19:13:18,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:13:19,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-12-02 19:13:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:13:22,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458961690] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:13:22,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2001774305] [2023-12-02 19:13:22,233 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-12-02 19:13:22,234 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:13:22,234 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:13:22,234 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:13:22,234 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:13:23,360 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:13:44,283 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 233 DAG size of output: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:14:34,253 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9586#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 0) 0) (exists ((|v_#valid_141| (Array Int Int))) (and (= (store |v_#valid_141| |ULTIMATE.start_main_~data~0#1.base| 0) |#valid|) (= (select |v_#valid_141| |ULTIMATE.start_main_~data~0#1.base|) 1))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1.base|)) (and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) 4)) (<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|) (<= 8 (select |#length| |ULTIMATE.start_main_~item2~0#1.base|)) (= |ULTIMATE.start_main_~item2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) 4) 14) (exists ((|v_#valid_144| (Array Int Int))) (and (= (select |v_#valid_144| |ULTIMATE.start_main_~item2~0#1.base|) 1) (= |#valid| (store |v_#valid_144| |ULTIMATE.start_main_~item2~0#1.base| 0)))))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~item~0#1.base| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-12-02 19:14:34,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:14:34,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:14:34,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 25 [2023-12-02 19:14:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099350751] [2023-12-02 19:14:34,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:14:34,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 19:14:34,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:14:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 19:14:34,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2308, Unknown=12, NotChecked=98, Total=2652 [2023-12-02 19:14:34,257 INFO L87 Difference]: Start difference. First operand 219 states and 301 transitions. Second operand has 27 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:14:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:14:37,722 INFO L93 Difference]: Finished difference Result 239 states and 323 transitions. [2023-12-02 19:14:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:14:37,723 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 19:14:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:14:37,725 INFO L225 Difference]: With dead ends: 239 [2023-12-02 19:14:37,725 INFO L226 Difference]: Without dead ends: 237 [2023-12-02 19:14:37,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 75.6s TimeCoverageRelationStatistics Valid=348, Invalid=3304, Unknown=12, NotChecked=118, Total=3782 [2023-12-02 19:14:37,728 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 116 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:14:37,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 553 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 844 Invalid, 0 Unknown, 158 Unchecked, 2.3s Time] [2023-12-02 19:14:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-02 19:14:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2023-12-02 19:14:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 187 states have (on average 1.6844919786096257) internal successors, (315), 226 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:14:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 315 transitions. [2023-12-02 19:14:37,734 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 315 transitions. Word has length 34 [2023-12-02 19:14:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:14:37,734 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 315 transitions. [2023-12-02 19:14:37,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:14:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 315 transitions. [2023-12-02 19:14:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 19:14:37,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:14:37,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:14:37,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:14:37,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 19:14:37,936 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:14:37,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:14:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1501771532, now seen corresponding path program 1 times [2023-12-02 19:14:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:14:37,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102838674] [2023-12-02 19:14:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:14:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:14:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:14:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:14:38,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:14:38,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102838674] [2023-12-02 19:14:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102838674] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:14:38,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392639609] [2023-12-02 19:14:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:14:38,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:14:38,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:14:38,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:14:38,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:14:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:14:39,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 19:14:39,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:14:39,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:14:39,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:14:39,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:14:39,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:14:39,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:14:39,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 23 treesize of output 11 [2023-12-02 19:14:39,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:14:39,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:14:39,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:14:39,503 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:14:39,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:14:39,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:14:39,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:14:39,691 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 20 treesize of output 15 [2023-12-02 19:14:39,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 19:14:40,352 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 19:14:40,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2023-12-02 19:14:40,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:14:40,377 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 15 treesize of output 15 [2023-12-02 19:14:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:14:40,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:14:41,350 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 [2023-12-02 19:14:41,458 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2023-12-02 19:14:41,458 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 49 [2023-12-02 19:14:41,522 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse0 (not .cse4)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_915 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_4))) (or (= (select (select .cse1 (select v_arrayElimArr_4 4)) 0) 0) (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_4 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_ArrVal_915 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_915))) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select .cse3 v_arrayElimCell_44) 0) 0)) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or .cse4 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_4) (select v_arrayElimArr_4 4)) 0) 0) (not (= (select v_arrayElimArr_4 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse4 (forall ((v_ArrVal_915 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_915) v_arrayElimCell_44) 0) 0)))))) is different from false [2023-12-02 19:14:42,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-12-02 19:14:42,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 19:14:42,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:14:42,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2023-12-02 19:14:42,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:14:42,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 19:14:42,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:14:42,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-02 19:14:42,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:14:43,003 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:14:43,003 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 16 treesize of output 11 [2023-12-02 19:14:43,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 19:14:43,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:14:43,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:14:43,044 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 75 treesize of output 79 [2023-12-02 19:14:43,054 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 38 treesize of output 34 [2023-12-02 19:14:43,081 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 48 treesize of output 46 [2023-12-02 19:14:43,106 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 80 treesize of output 76 [2023-12-02 19:14:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:14:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392639609] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:14:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [177591534] [2023-12-02 19:14:43,333 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-12-02 19:14:43,333 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:14:43,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:14:43,334 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:14:43,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:14:44,395 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:15:06,037 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 233 DAG size of output: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:15:47,961 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10330#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 1 |#StackHeapBarrier|) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)) (<= |ULTIMATE.start_main_~c1~0#1| 1))' at error location [2023-12-02 19:15:47,961 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:15:47,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:15:47,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 35 [2023-12-02 19:15:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930248150] [2023-12-02 19:15:47,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:15:47,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 19:15:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:15:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 19:15:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2950, Unknown=17, NotChecked=112, Total=3422 [2023-12-02 19:15:47,965 INFO L87 Difference]: Start difference. First operand 227 states and 315 transitions. Second operand has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:15:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:15:52,973 INFO L93 Difference]: Finished difference Result 246 states and 332 transitions. [2023-12-02 19:15:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 19:15:52,974 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 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 34 [2023-12-02 19:15:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:15:52,976 INFO L225 Difference]: With dead ends: 246 [2023-12-02 19:15:52,976 INFO L226 Difference]: Without dead ends: 229 [2023-12-02 19:15:52,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=563, Invalid=4680, Unknown=17, NotChecked=142, Total=5402 [2023-12-02 19:15:52,980 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 236 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:15:52,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1076 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1299 Invalid, 0 Unknown, 126 Unchecked, 3.1s Time] [2023-12-02 19:15:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-02 19:15:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 204. [2023-12-02 19:15:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.7378048780487805) internal successors, (285), 203 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:15:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2023-12-02 19:15:52,988 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 34 [2023-12-02 19:15:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:15:52,988 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2023-12-02 19:15:52,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:15:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2023-12-02 19:15:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 19:15:52,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:15:52,990 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:15:52,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:15:53,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 19:15:53,193 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:15:53,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:15:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -277129970, now seen corresponding path program 1 times [2023-12-02 19:15:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:15:53,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134213235] [2023-12-02 19:15:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:15:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:15:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:15:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:15:53,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:15:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134213235] [2023-12-02 19:15:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134213235] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:15:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010835140] [2023-12-02 19:15:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:15:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:15:53,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:15:53,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:15:53,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:15:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:15:53,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:15:53,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:15:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:15:53,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:15:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:15:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010835140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:15:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2097676832] [2023-12-02 19:15:53,725 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 19:15:53,725 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:15:53,725 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:15:53,725 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:15:53,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:16:13,451 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:16:29,658 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 0 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse7 (<= |c_ULTIMATE.start_main_~c1~0#1| 5)) (.cse2 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse0 (= 0 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse10 (<= 1 |c_#StackHeapBarrier|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (.cse13 (= |c_ULTIMATE.start_main_~c1~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~item~0#1.offset| 0))) (and (or (not .cse0) (not .cse1)) (let ((.cse6 (not (= |c_ULTIMATE.start_main_~lItem~0#1.base| 0))) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) 4)) (.cse9 (<= (+ |c_ULTIMATE.start_main_~lItem~0#1.base| 1) |c_#StackHeapBarrier|))) (or (and .cse2 (exists ((|v_#length_144| (Array Int Int))) (and (<= 8 (select |v_#length_144| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (store |v_#length_144| |c_ULTIMATE.start_main_~lItem~0#1.base| 8) |c_#length|))) .cse3 (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_main_~item~0#1.base|) 4 .cse4)))) (exists ((|v_#memory_int_171| (Array Int (Array Int Int)))) (= (store |v_#memory_int_171| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |v_#memory_int_171| |c_ULTIMATE.start_main_~item~0#1.base|) 4 (+ (* 2 |c_ULTIMATE.start_main_~c1~0#1|) 4))) |c_#memory_int|)) (exists ((|v_#valid_178| (Array Int Int))) (and (= (select |v_#valid_178| |c_ULTIMATE.start_main_~lItem~0#1.base|) 0) (= (select |v_#valid_178| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (= |c_#valid| (store |v_#valid_178| |c_ULTIMATE.start_main_~lItem~0#1.base| 1)))) .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_main_~item~0#1.base|) 4 .cse8)))) .cse9) (let ((.cse14 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~item~0#1.base| 1))) (and .cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~item~0#1.base|) 0) .cse0 (exists ((|v_#length_131| (Array Int Int))) (and (= 2 (select |v_#length_131| 1)) (= 14 (select |v_#length_131| 2)) (= (store (store |v_#length_131| |c_ULTIMATE.start_main_~item~0#1.base| 8) |c_ULTIMATE.start_main_~lItem~0#1.base| 8) |c_#length|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) .cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1) .cse1 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_132| 1)) (.cse11 (select |v_#memory_int_133| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= (store |v_#memory_int_132| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |v_#memory_int_132| |c_ULTIMATE.start_main_~item~0#1.base|) 0 (select .cse11 0))) |v_#memory_int_133|) (= (select .cse12 0) 48) (= 0 (select .cse12 1)) (= (store |v_#memory_int_133| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse11 4 6)) |c_#memory_int|)))) (exists ((|v_ULTIMATE.start_main_#t~nondet3#1_52| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet3#1_52| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3#1_52| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet3#1_52| 0)))) (not (= |c_ULTIMATE.start_main_~item~0#1.base| 0)) .cse13 (= (select .cse14 |c_ULTIMATE.start_main_~lItem~0#1.base|) 0) .cse5 .cse6 (exists ((|v_#memory_$Pointer$.offset_159| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_156| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (let ((.cse15 (select |v_#memory_$Pointer$.offset_158| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse16 (select |v_#memory_$Pointer$.offset_159| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_158| (store |v_#memory_$Pointer$.offset_156| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_156| |c_ULTIMATE.start_main_~item~0#1.base|) 0 0) 4 (select .cse15 4)))) (= (store |v_#memory_$Pointer$.offset_159| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse16 4 .cse8)) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.offset_158| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse15 4 (select .cse16 4))) |v_#memory_$Pointer$.offset_159|)))) (<= (+ |c_ULTIMATE.start_main_~item~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1) (exists ((|v_#memory_$Pointer$.base_160| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_157| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_#memory_$Pointer$.base_160| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse18 (select |v_#memory_$Pointer$.base_159| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_160| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse17 4 .cse4))) (= (store |v_#memory_$Pointer$.base_159| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse18 4 (select .cse17 4))) |v_#memory_$Pointer$.base_160|) (= (store |v_#memory_$Pointer$.base_157| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |v_#memory_$Pointer$.base_157| |c_ULTIMATE.start_main_~item~0#1.base|) 0 0) 4 (select .cse18 4))) |v_#memory_$Pointer$.base_159|)))) .cse9 (= |c_#valid| (store .cse14 |c_ULTIMATE.start_main_~lItem~0#1.base| 1)))))) (or (and .cse2 .cse3 .cse5 .cse7) (and .cse2 .cse0 .cse10 .cse1 .cse13 .cse5)))) is different from true [2023-12-02 19:16:41,910 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11044#(and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)))' at error location [2023-12-02 19:16:41,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:16:41,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:16:41,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-12-02 19:16:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399292505] [2023-12-02 19:16:41,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:16:41,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:16:41,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:16:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:16:41,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=670, Unknown=14, NotChecked=54, Total=870 [2023-12-02 19:16:41,913 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:16:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:16:42,505 INFO L93 Difference]: Finished difference Result 836 states and 1158 transitions. [2023-12-02 19:16:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:16:42,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 19:16:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:16:42,511 INFO L225 Difference]: With dead ends: 836 [2023-12-02 19:16:42,512 INFO L226 Difference]: Without dead ends: 836 [2023-12-02 19:16:42,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=132, Invalid=670, Unknown=14, NotChecked=54, Total=870 [2023-12-02 19:16:42,513 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 866 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:16:42,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 703 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:16:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2023-12-02 19:16:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 210. [2023-12-02 19:16:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 170 states have (on average 1.6176470588235294) internal successors, (275), 209 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:16:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 275 transitions. [2023-12-02 19:16:42,525 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 275 transitions. Word has length 34 [2023-12-02 19:16:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:16:42,525 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 275 transitions. [2023-12-02 19:16:42,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:16:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 275 transitions. [2023-12-02 19:16:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 19:16:42,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:16:42,526 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:16:42,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:16:42,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:16:42,734 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:16:42,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:16:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1415553369, now seen corresponding path program 1 times [2023-12-02 19:16:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:16:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401597164] [2023-12-02 19:16:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:16:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:16:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:16:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:16:43,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:16:43,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401597164] [2023-12-02 19:16:43,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401597164] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:16:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246918712] [2023-12-02 19:16:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:16:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:16:43,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:16:43,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:16:43,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:16:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:16:43,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 19:16:43,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:16:43,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:16:43,482 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 19:16:43,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 19:16:43,585 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:16:43,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 19:16:43,701 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 [2023-12-02 19:16:43,788 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:16:43,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-12-02 19:16:43,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:16:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:16:43,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:16:43,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246918712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:16:43,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:16:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2023-12-02 19:16:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935724297] [2023-12-02 19:16:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:16:43,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:16:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:16:43,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:16:43,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:16:43,967 INFO L87 Difference]: Start difference. First operand 210 states and 275 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:16:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:16:44,831 INFO L93 Difference]: Finished difference Result 232 states and 274 transitions. [2023-12-02 19:16:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 19:16:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-12-02 19:16:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:16:44,833 INFO L225 Difference]: With dead ends: 232 [2023-12-02 19:16:44,833 INFO L226 Difference]: Without dead ends: 232 [2023-12-02 19:16:44,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-02 19:16:44,833 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 98 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:16:44,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 243 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:16:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-12-02 19:16:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2023-12-02 19:16:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 170 states have (on average 1.6) internal successors, (272), 209 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:16:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2023-12-02 19:16:44,838 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 272 transitions. Word has length 36 [2023-12-02 19:16:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:16:44,838 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 272 transitions. [2023-12-02 19:16:44,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:16:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 272 transitions. [2023-12-02 19:16:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 19:16:44,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:16:44,839 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:16:44,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 19:16:45,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 19:16:45,040 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:16:45,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:16:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1415553368, now seen corresponding path program 1 times [2023-12-02 19:16:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:16:45,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25383945] [2023-12-02 19:16:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:16:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:16:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:16:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:16:45,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:16:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25383945] [2023-12-02 19:16:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25383945] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:16:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151621636] [2023-12-02 19:16:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:16:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:16:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:16:45,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:16:45,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:16:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:16:45,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 19:16:45,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:16:45,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:16:46,054 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 19:16:46,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 19:16:46,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:16:46,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:16:46,339 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 [2023-12-02 19:16:46,350 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 [2023-12-02 19:16:46,473 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:16:46,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:16:46,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:16:46,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:16:46,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:16:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:16:46,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:16:46,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:16:46,967 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 42 treesize of output 46 [2023-12-02 19:16:47,024 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1384 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 4))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1385) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~lItem~0#1.base|)) (forall ((v_prenex_13 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_prenex_13) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 1)))) is different from false [2023-12-02 19:16:47,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:16:47,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 19:16:47,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-12-02 19:16: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 5 treesize of output 3 [2023-12-02 19:16:47,063 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:16:47,064 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 20 treesize of output 1 [2023-12-02 19:16:47,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:16:47,075 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 20 treesize of output 21 [2023-12-02 19:16:47,079 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:16:47,082 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 18 treesize of output 10 [2023-12-02 19:16:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 19:16:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151621636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:16:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [976580610] [2023-12-02 19:16:47,559 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 19:16:47,559 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:16:47,560 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:16:47,560 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:16:47,560 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:17:04,901 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:17:15,789 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 189 DAG size of output: 176 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:17:23,974 WARN L293 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 223 DAG size of output: 207 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:17:40,703 WARN L293 SmtUtils]: Spent 15.46s on a formula simplification. DAG size of input: 248 DAG size of output: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:17:53,174 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12911#(and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (or (< (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|) (+ |ULTIMATE.start_main_#t~mem11#1.offset| 8)) (< (+ |ULTIMATE.start_main_#t~mem11#1.offset| 4) 0)) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.base| 0))' at error location [2023-12-02 19:17:53,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:17:53,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:17:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2023-12-02 19:17:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564072709] [2023-12-02 19:17:53,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:17:53,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 19:17:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:17:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 19:17:53,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1791, Unknown=6, NotChecked=86, Total=2070 [2023-12-02 19:17:53,177 INFO L87 Difference]: Start difference. First operand 210 states and 272 transitions. Second operand has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:17:57,367 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2023-12-02 19:17:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:17:57,368 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-02 19:17:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:17:57,369 INFO L225 Difference]: With dead ends: 247 [2023-12-02 19:17:57,369 INFO L226 Difference]: Without dead ends: 247 [2023-12-02 19:17:57,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=430, Invalid=3228, Unknown=6, NotChecked=118, Total=3782 [2023-12-02 19:17:57,371 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 511 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:17:57,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 604 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1272 Invalid, 0 Unknown, 194 Unchecked, 2.6s Time] [2023-12-02 19:17:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-02 19:17:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 210. [2023-12-02 19:17:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 209 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 269 transitions. [2023-12-02 19:17:57,377 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 269 transitions. Word has length 36 [2023-12-02 19:17:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:17:57,378 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 269 transitions. [2023-12-02 19:17:57,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 269 transitions. [2023-12-02 19:17:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 19:17:57,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:17:57,379 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:17:57,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:17:57,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 19:17:57,580 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:17:57,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:17:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash 166948611, now seen corresponding path program 1 times [2023-12-02 19:17:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:17:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339333553] [2023-12-02 19:17:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:17:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:17:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:17:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:17:57,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:17:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339333553] [2023-12-02 19:17:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339333553] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:17:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583270244] [2023-12-02 19:17:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:17:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:17:57,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:17:57,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:17:57,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:17:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:17:58,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 19:17:58,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:17:58,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:17:58,187 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 19:17:58,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 19:17:58,237 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:17:58,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:17:58,258 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 [2023-12-02 19:17:58,291 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:17:58,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 19:17:58,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 16 treesize of output 8 [2023-12-02 19:17:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:17:58,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:17:58,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:17:58,408 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 19 treesize of output 20 [2023-12-02 19:17:58,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-12-02 19:17:58,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 19:17:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:17:58,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583270244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:17:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810232733] [2023-12-02 19:17:58,582 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 19:17:58,582 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:17:58,582 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:17:58,583 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:17:58,583 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:18:19,325 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:18:27,057 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13667#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 0) 0) (exists ((|v_#valid_229| (Array Int Int))) (and (= (store |v_#valid_229| |ULTIMATE.start_main_~data~0#1.base| 0) |#valid|) (= (select |v_#valid_229| |ULTIMATE.start_main_~data~0#1.base|) 1))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~item~0#1.base| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1.base|) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-12-02 19:18:27,057 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:18:27,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:18:27,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 13 [2023-12-02 19:18:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38402061] [2023-12-02 19:18:27,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:18:27,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 19:18:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:18:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 19:18:27,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1219, Unknown=4, NotChecked=0, Total=1406 [2023-12-02 19:18:27,060 INFO L87 Difference]: Start difference. First operand 210 states and 269 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:18:28,342 INFO L93 Difference]: Finished difference Result 225 states and 266 transitions. [2023-12-02 19:18:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:18:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 39 [2023-12-02 19:18:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:18:28,344 INFO L225 Difference]: With dead ends: 225 [2023-12-02 19:18:28,344 INFO L226 Difference]: Without dead ends: 225 [2023-12-02 19:18:28,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=250, Invalid=1726, Unknown=4, NotChecked=0, Total=1980 [2023-12-02 19:18:28,345 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 158 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:18:28,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 372 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 19:18:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-02 19:18:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 207. [2023-12-02 19:18:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.5868263473053892) internal successors, (265), 206 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 265 transitions. [2023-12-02 19:18:28,349 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 265 transitions. Word has length 39 [2023-12-02 19:18:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:28,349 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 265 transitions. [2023-12-02 19:18:28,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 265 transitions. [2023-12-02 19:18:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 19:18:28,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:28,350 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:28,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 19:18:28,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 19:18:28,551 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:18:28,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash 667854006, now seen corresponding path program 1 times [2023-12-02 19:18:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:28,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676531535] [2023-12-02 19:18:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:18:29,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:18:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676531535] [2023-12-02 19:18:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676531535] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:18:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637571862] [2023-12-02 19:18:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:29,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:18:29,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:18:29,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:18:29,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 19:18:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:29,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 19:18:29,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:18:29,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:18:29,460 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 19:18:29,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 19:18:29,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:18:29,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:18:29,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:18:29,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:18:29,878 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 43 treesize of output 27 [2023-12-02 19:18:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:18:29,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:18:30,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:18:30,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 19:18:30,061 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 29 treesize of output 21 [2023-12-02 19:18:30,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 19:18:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:18:30,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637571862] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:18:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954889871] [2023-12-02 19:18:30,272 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 19:18:30,272 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:18:30,272 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:18:30,272 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:18:30,273 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:18:50,659 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:19:11,297 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14397#(and (exists ((|v_#memory_int_361| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_361| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_361| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))))) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~lItem~0#1.base|) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_394| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_387| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_387| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~item~0#1.offset|) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1.base|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_387| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_387| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |v_#memory_$Pointer$.offset_387| |ULTIMATE.start_main_~lItem~0#1.base|) 0)))) (= (select (select |v_#memory_$Pointer$.base_394| (select (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) |ULTIMATE.start_main_~item2~0#1.base|) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (= |ULTIMATE.start_main_~lItem~0#1.base| (select (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= (store |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~lItem~0#1.base|) 0))) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.offset_387| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= |ULTIMATE.start_main_~item2~0#1.offset| (select (select |v_#memory_$Pointer$.offset_387| (select (select |v_#memory_$Pointer$.base_394| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4)))))' at error location [2023-12-02 19:19:11,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:19:11,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:19:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2023-12-02 19:19:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413140751] [2023-12-02 19:19:11,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:19:11,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 19:19:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:11,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 19:19:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1730, Unknown=7, NotChecked=0, Total=1980 [2023-12-02 19:19:11,300 INFO L87 Difference]: Start difference. First operand 207 states and 265 transitions. Second operand has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:14,041 INFO L93 Difference]: Finished difference Result 224 states and 265 transitions. [2023-12-02 19:19:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:19:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-02 19:19:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:14,043 INFO L225 Difference]: With dead ends: 224 [2023-12-02 19:19:14,043 INFO L226 Difference]: Without dead ends: 224 [2023-12-02 19:19:14,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=518, Invalid=3507, Unknown=7, NotChecked=0, Total=4032 [2023-12-02 19:19:14,045 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 461 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:14,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 497 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 19:19:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-02 19:19:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2023-12-02 19:19:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.5808383233532934) internal successors, (264), 206 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 264 transitions. [2023-12-02 19:19:14,051 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 264 transitions. Word has length 41 [2023-12-02 19:19:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:19:14,051 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 264 transitions. [2023-12-02 19:19:14,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 264 transitions. [2023-12-02 19:19:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 19:19:14,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:19:14,052 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:19:14,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 19:19:14,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:19:14,253 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:19:14,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:19:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1750333866, now seen corresponding path program 1 times [2023-12-02 19:19:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:19:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137936262] [2023-12-02 19:19:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:19:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:19:16,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:16,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137936262] [2023-12-02 19:19:16,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137936262] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:19:16,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108107758] [2023-12-02 19:19:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:16,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:19:16,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:19:16,054 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:19:16,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 19:19:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:16,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 19:19:16,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:19:16,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:19:16,315 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 19:19:16,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 19:19:16,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:19:16,778 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-12-02 19:19:16,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2023-12-02 19:19:16,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 19:19:17,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 19:19:17,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 19:19:17,431 INFO L349 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2023-12-02 19:19:17,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2023-12-02 19:19:17,850 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 34 treesize of output 25 [2023-12-02 19:19:17,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2023-12-02 19:19:18,119 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:19:18,120 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 62 treesize of output 53 [2023-12-02 19:19:19,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:19:19,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2023-12-02 19:19:19,639 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:19:19,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-02 19:19:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:19:19,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:19:20,600 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 8 treesize of output 4 [2023-12-02 19:19:20,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse0 .cse1))) 1)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse2 .cse1)) 1)))))) is different from false [2023-12-02 19:19:20,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)))) (and (or (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int))) (= (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse0 .cse1))) 1)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int))) (let ((.cse3 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse3 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse3 .cse1)) 1)))))) is different from false [2023-12-02 19:19:20,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse0 .cse1)) 1) (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (= (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse2 .cse1))) 1))))) is different from false [2023-12-02 19:19:22,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:19:22,582 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 152 treesize of output 102 [2023-12-02 19:19:22,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:19:22,617 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 386 treesize of output 384 [2023-12-02 19:19:22,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:19:22,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:19:22,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-12-02 19:19:22,671 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:19:22,672 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 87 treesize of output 81 [2023-12-02 19:19:22,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 4 [2023-12-02 19:19:22,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:19:22,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:19:22,802 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 81 treesize of output 89 [2023-12-02 19:19:33,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:19:33,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 75 [2023-12-02 19:19:33,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:19:33,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 131 [2023-12-02 19:19:33,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-12-02 19:19:33,619 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 41 treesize of output 37 [2023-12-02 19:20:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 19:20:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108107758] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:20:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1654986731] [2023-12-02 19:20:17,658 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-12-02 19:20:17,658 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:20:17,658 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:20:17,658 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:20:17,658 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:20:37,515 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:21:15,351 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15204#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~dst~0#1.base|) (or (not (= |ULTIMATE.start_main_~item2~0#1.base| 0)) (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0))) (exists ((|v_#memory_$Pointer$.base_471| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_457| (Array Int (Array Int Int))) (|v_#valid_282| (Array Int Int))) (and (= (store |v_#valid_282| |ULTIMATE.start_main_~lItem~0#1.base| 0) |#valid|) (= (select (select |v_#memory_$Pointer$.offset_457| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select (select |v_#memory_$Pointer$.offset_457| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~item~0#1.offset|) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| (select (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (= |ULTIMATE.start_main_~item2~0#1.base| (select (select |v_#memory_$Pointer$.base_471| (select (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4)) (= |ULTIMATE.start_main_~lItem~0#1.base| (select (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |v_#valid_282| |ULTIMATE.start_main_~lItem~0#1.base|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_457| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_457| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |v_#memory_$Pointer$.offset_457| |ULTIMATE.start_main_~lItem~0#1.base|) 0)))) (= (select |v_#valid_282| |ULTIMATE.start_main_~data~0#1.base|) 1) (= |ULTIMATE.start_main_~item2~0#1.offset| (select (select |v_#memory_$Pointer$.offset_457| (select (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4)) (= (store |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~lItem~0#1.base|) 0))) |#memory_$Pointer$.base|) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_471| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))))) (exists ((|v_#memory_int_431| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_431| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_431| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))))) (= |ULTIMATE.start_main_~dst~0#1.offset| (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|) (or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~item~0#1.base| 0))))' at error location [2023-12-02 19:21:15,352 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:21:15,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:21:15,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 20] total 49 [2023-12-02 19:21:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68312035] [2023-12-02 19:21:15,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:21:15,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 19:21:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 19:21:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5302, Unknown=23, NotChecked=450, Total=6162 [2023-12-02 19:21:15,357 INFO L87 Difference]: Start difference. First operand 207 states and 264 transitions. Second operand has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:17,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:21:19,661 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] [2023-12-02 19:21:21,706 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] [2023-12-02 19:21:24,238 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] [2023-12-02 19:21:27,225 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] [2023-12-02 19:21:29,252 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] [2023-12-02 19:21:34,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:21:36,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:21:48,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 4)) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1))) (and (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) .cse0 (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse2 .cse3)) 1) (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|)))) (or .cse0 (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (= (let ((.cse4 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse4 .cse3))) 1)))))) (= (select |c_#valid| .cse5) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (or (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~lItem~0#1.base| 0) .cse5) 1)) .cse1)) is different from false [2023-12-02 19:21:49,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 4)) (.cse1 (< |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (.cse4 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1))) (and (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) .cse0 (or .cse1 (not .cse2) (and (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse3 .cse4)) 1) (= (select .cse3 0) |c_ULTIMATE.start_main_~data~0#1.base|)))) (or .cse0 (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (= (let ((.cse5 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse5 .cse4))) 1))))) (= (select |c_#valid| .cse6) 1) (or (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~lItem~0#1.base| 0) .cse6) 1)) (or .cse1 (and (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_132| Int) (v_ArrVal_1911 (Array Int Int))) (or (forall ((v_ArrVal_1912 Int)) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_132| v_ArrVal_1912))) (or (not (= (select .cse7 |c_ULTIMATE.start_main_~data~0#1.base|) 1)) (forall ((v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1911))) (store .cse9 |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store .cse9 |v_ULTIMATE.start_main_~lItem~0#1.base_132| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |v_ULTIMATE.start_main_~lItem~0#1.base_132|))) |v_ULTIMATE.start_main_~lItem~0#1.base_132| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse8 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store .cse7 (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse8 .cse4)) 1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_132|) 0)))) (or (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_132| Int) (v_ArrVal_1911 (Array Int Int)) (v_ArrVal_1917 Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1912 Int) (v_ArrVal_1913 (Array Int Int))) (let ((.cse10 (store |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_132| v_ArrVal_1912))) (or (= (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1911))) (store .cse12 |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store .cse12 |v_ULTIMATE.start_main_~lItem~0#1.base_132| v_ArrVal_1913) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |v_ULTIMATE.start_main_~lItem~0#1.base_132|))) |v_ULTIMATE.start_main_~lItem~0#1.base_132| v_ArrVal_1916) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store .cse10 (select .cse11 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1917) (select .cse11 .cse4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_132|) 0)) (not (= (select .cse10 |c_ULTIMATE.start_main_~data~0#1.base|) 1))))) .cse0))) .cse2)) is different from false [2023-12-02 19:21:55,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:21:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:56,791 INFO L93 Difference]: Finished difference Result 379 states and 460 transitions. [2023-12-02 19:21:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 19:21:56,792 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-02 19:21:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:56,794 INFO L225 Difference]: With dead ends: 379 [2023-12-02 19:21:56,794 INFO L226 Difference]: Without dead ends: 379 [2023-12-02 19:21:56,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 3902 ImplicationChecksByTransitivity, 79.0s TimeCoverageRelationStatistics Valid=1161, Invalid=9961, Unknown=28, NotChecked=1060, Total=12210 [2023-12-02 19:21:56,798 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 696 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 98 mSolverCounterUnsat, 185 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 3215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 185 IncrementalHoareTripleChecker+Unknown, 944 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:56,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1121 Invalid, 3215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1988 Invalid, 185 Unknown, 944 Unchecked, 32.7s Time] [2023-12-02 19:21:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-12-02 19:21:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 205. [2023-12-02 19:21:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.5696969696969696) internal successors, (259), 204 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2023-12-02 19:21:56,802 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 259 transitions. Word has length 44 [2023-12-02 19:21:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:56,803 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 259 transitions. [2023-12-02 19:21:56,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2023-12-02 19:21:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 19:21:56,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:56,804 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:56,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 19:21:57,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-02 19:21:57,004 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:21:57,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1750333867, now seen corresponding path program 1 times [2023-12-02 19:21:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722799274] [2023-12-02 19:21:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:21:59,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:59,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722799274] [2023-12-02 19:21:59,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722799274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:21:59,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575466532] [2023-12-02 19:21:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:59,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:59,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:21:59,021 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:21:59,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 19:21:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:59,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 19:21:59,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:21:59,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:21:59,501 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:21:59,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 19:21:59,574 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:21:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 19:21:59,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:21:59,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:22:00,144 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-12-02 19:22:00,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-12-02 19:22:00,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:22:00,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:22:00,347 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 43 treesize of output 32 [2023-12-02 19:22:00,543 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 43 treesize of output 32 [2023-12-02 19:22:00,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:22:00,692 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 43 treesize of output 32 [2023-12-02 19:22:00,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:22:00,938 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-02 19:22:00,938 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 [2023-12-02 19:22:01,040 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-12-02 19:22:01,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-12-02 19:22:01,403 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 34 treesize of output 25 [2023-12-02 19:22:01,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:22:01,486 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 37 treesize of output 28 [2023-12-02 19:22:01,527 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 19 treesize of output 18 [2023-12-02 19:22:01,754 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:22:01,754 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 73 treesize of output 62 [2023-12-02 19:22:01,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-12-02 19:22:02,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 28 [2023-12-02 19:22:02,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 19:22:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:22:03,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:22:04,849 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse5 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse6 (forall ((v_ArrVal_2107 (Array Int Int))) (let ((.cse10 (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2107))) (let ((.cse11 (store (select .cse12 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base| .cse11) |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select (store .cse12 |c_ULTIMATE.start_main_~data~0#1.base| .cse11) |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse10 |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (< 0 (+ 5 (select .cse10 .cse1)))))))) (and (forall ((v_ArrVal_2107 (Array Int Int))) (let ((.cse0 (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2107))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base| .cse3) |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select (store .cse4 |c_ULTIMATE.start_main_~data~0#1.base| .cse3) |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2113 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2108) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2113) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (< (+ 7 (select .cse0 .cse1)) (select |c_#length| (select .cse2 .cse1))) (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|)))) (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) 0))))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2113 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2108) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2113) |c_ULTIMATE.start_main_~data~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1.base|)) .cse6) (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (and .cse6 (forall ((v_ArrVal_2107 (Array Int Int))) (let ((.cse7 (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2107))) (let ((.cse8 (store (select .cse9 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base| .cse8) |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select (store .cse9 |c_ULTIMATE.start_main_~data~0#1.base| .cse8) |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2113 (Array Int Int))) (<= (+ (select .cse7 .cse1) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2108) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2113) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1)))) (not (= (select .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))))))))) is different from false [2023-12-02 19:22:10,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,141 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 96 treesize of output 67 [2023-12-02 19:22:10,146 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:10,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,166 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 268 treesize of output 270 [2023-12-02 19:22:10,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 33 treesize of output 29 [2023-12-02 19:22:10,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:10,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-12-02 19:22:10,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 19:22:10,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2023-12-02 19:22:10,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,458 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 150 treesize of output 141 [2023-12-02 19:22:10,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,491 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 592 treesize of output 591 [2023-12-02 19:22:10,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,511 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 340 treesize of output 230 [2023-12-02 19:22:10,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:10,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,570 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 2376 treesize of output 2358 [2023-12-02 19:22:10,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 53 treesize of output 49 [2023-12-02 19:22:10,600 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 [2023-12-02 19:22:10,611 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 68 treesize of output 60 [2023-12-02 19:22:10,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:10,624 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 48 treesize of output 40 [2023-12-02 19:22:10,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 19:22:10,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,704 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 39 treesize of output 39 [2023-12-02 19:22:10,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,949 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 198 treesize of output 168 [2023-12-02 19:22:10,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:10,979 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 670 treesize of output 672 [2023-12-02 19:22:11,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:11,002 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 344 treesize of output 234 [2023-12-02 19:22:11,021 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:11,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:11,057 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 2472 treesize of output 2454 [2023-12-02 19:22:11,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:11,086 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 99 treesize of output 93 [2023-12-02 19:22:11,102 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 53 treesize of output 49 [2023-12-02 19:22:11,116 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:11,117 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 78 treesize of output 68 [2023-12-02 19:22:11,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2023-12-02 19:22:11,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 19:22:11,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 19:22:11,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:11,352 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 43 treesize of output 43 [2023-12-02 19:22:11,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:11,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:11,465 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 72 treesize of output 80 [2023-12-02 19:22:12,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:12,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2023-12-02 19:22:12,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:12,721 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 96 treesize of output 67 [2023-12-02 19:22:12,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:12,764 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 163 treesize of output 165 [2023-12-02 19:22:12,781 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:12,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:12,809 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 268 treesize of output 270 [2023-12-02 19:22:12,831 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 41 treesize of output 39 [2023-12-02 19:22:12,846 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 33 treesize of output 29 [2023-12-02 19:22:12,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 19:22:12,878 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 50 treesize of output 42 [2023-12-02 19:22:12,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 19:22:12,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 19:22:13,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:13,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2023-12-02 19:22:13,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:13,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2023-12-02 19:22:19,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:22:19,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 903 treesize of output 895 [2023-12-02 19:22:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:22:26,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575466532] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:22:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [940115962] [2023-12-02 19:22:26,225 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-12-02 19:22:26,225 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:22:26,226 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:22:26,226 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:22:26,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:22:55,956 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:23:09,726 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16192#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~dst~0#1.base|) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_507| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_507| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_507| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (or (not (= |ULTIMATE.start_main_~item2~0#1.base| 0)) (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~dst~0#1.offset| 4) (or (< (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 0) (< (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (+ 8 |ULTIMATE.start_main_~item~0#1.offset|))) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~item~0#1.base| 0))) (exists ((|v_#valid_312| (Array Int Int)) (|v_#memory_$Pointer$.base_554| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_540| (Array Int (Array Int Int)))) (and (not (= |ULTIMATE.start_main_~data~0#1.base| (select (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base|) 0))) (= (select (select |v_#memory_$Pointer$.offset_540| |ULTIMATE.start_main_~data~0#1.base|) 0) 0) (= (select |v_#valid_312| |ULTIMATE.start_main_~lItem~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~lItem~0#1.base|) 0))) |#memory_$Pointer$.base|) (= (store |v_#valid_312| |ULTIMATE.start_main_~lItem~0#1.base| 0) |#valid|) (= |ULTIMATE.start_main_~item2~0#1.base| (select (select |v_#memory_$Pointer$.base_554| (select (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base|) 0)) 4)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |v_#memory_$Pointer$.offset_540| |ULTIMATE.start_main_~data~0#1.base|) 4) |ULTIMATE.start_main_~item~0#1.offset|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_540| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_540| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_540| |ULTIMATE.start_main_~lItem~0#1.base|) 0)))) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base|) 0))) (= (select |v_#valid_312| |ULTIMATE.start_main_~data~0#1.base|) 1) (= |ULTIMATE.start_main_~lItem~0#1.base| (select (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base|) 0)) (= |ULTIMATE.start_main_~item2~0#1.offset| (select (select |v_#memory_$Pointer$.offset_540| (select (select |v_#memory_$Pointer$.base_554| |ULTIMATE.start_main_~data~0#1.base|) 0)) 4)))))' at error location [2023-12-02 19:23:09,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:23:09,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:23:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 19] total 48 [2023-12-02 19:23:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27650818] [2023-12-02 19:23:09,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:23:09,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 19:23:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:23:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 19:23:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=5677, Unknown=9, NotChecked=154, Total=6320 [2023-12-02 19:23:09,732 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. Second operand has 49 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 49 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:23:26,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:34,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:44,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:46,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:49,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:51,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:54,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:56,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:23:58,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:00,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:03,261 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] [2023-12-02 19:24:12,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:14,834 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] [2023-12-02 19:24:16,846 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] [2023-12-02 19:24:19,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:21,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:24,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:26,325 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] [2023-12-02 19:24:28,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:30,239 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] [2023-12-02 19:24:32,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:48,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:24:51,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:25:00,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:25:01,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:25:06,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:25:08,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 [1] [2023-12-02 19:25:11,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:25:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:13,045 INFO L93 Difference]: Finished difference Result 366 states and 443 transitions. [2023-12-02 19:25:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 19:25:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 49 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-02 19:25:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:13,048 INFO L225 Difference]: With dead ends: 366 [2023-12-02 19:25:13,048 INFO L226 Difference]: Without dead ends: 366 [2023-12-02 19:25:13,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3853 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=1263, Invalid=9430, Unknown=23, NotChecked=204, Total=10920 [2023-12-02 19:25:13,050 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1092 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 169 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 79.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:13,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 873 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2517 Invalid, 30 Unknown, 292 Unchecked, 79.3s Time] [2023-12-02 19:25:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-02 19:25:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 214. [2023-12-02 19:25:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 174 states have (on average 1.5919540229885059) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2023-12-02 19:25:13,056 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 44 [2023-12-02 19:25:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:13,057 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2023-12-02 19:25:13,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 49 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2023-12-02 19:25:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 19:25:13,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:13,058 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:13,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 19:25:13,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-02 19:25:13,259 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:25:13,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1574088273, now seen corresponding path program 1 times [2023-12-02 19:25:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:25:13,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953906031] [2023-12-02 19:25:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:25:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:13,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:25:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953906031] [2023-12-02 19:25:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953906031] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:25:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102280667] [2023-12-02 19:25:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:13,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:25:13,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:25:13,703 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:25:13,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 19:25:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:13,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 19:25:13,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:14,418 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 17 [2023-12-02 19:25:14,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 19:25:14,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 19:25:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:14,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:25:15,146 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 8 treesize of output 4 [2023-12-02 19:25:15,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:25:15,167 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 26 treesize of output 26 [2023-12-02 19:25:15,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 19:25:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102280667] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:25:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2029197272] [2023-12-02 19:25:15,407 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 19:25:15,407 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:25:15,407 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:25:15,407 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:25:15,407 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:25:35,760 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:25:48,844 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17142#(and (exists ((|v_#memory_int_567| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_567| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_567| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))))) (exists ((|v_#memory_$Pointer$.offset_600| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_614| (Array Int (Array Int Int))) (|v_#valid_335| (Array Int Int))) (and (= (store |v_#valid_335| |ULTIMATE.start_main_~lItem~0#1.base| 0) |#valid|) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |v_#memory_$Pointer$.offset_600| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |v_#memory_$Pointer$.base_614| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select |v_#valid_335| |ULTIMATE.start_main_~data~0#1.base|) 1) (= (select (select |v_#memory_$Pointer$.base_614| (select (select |v_#memory_$Pointer$.base_614| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4) 0) (= 0 (select (select |v_#memory_$Pointer$.offset_600| (select (select |v_#memory_$Pointer$.base_614| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 4)) (= (select (select |v_#memory_$Pointer$.offset_600| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |v_#memory_$Pointer$.base_614| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_600| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_600| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |v_#memory_$Pointer$.offset_600| |ULTIMATE.start_main_~lItem~0#1.base|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_614| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_614| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset| (select (select |v_#memory_$Pointer$.base_614| |ULTIMATE.start_main_~lItem~0#1.base|) 0)))))) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~dst~0#1.base|) (= |ULTIMATE.start_main_~item2~0#1.base| 0) (= |ULTIMATE.start_main_~dst~0#1.offset| (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~item2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_main_~dst~0#1.base|) 1)) (or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~item~0#1.base| 0))))' at error location [2023-12-02 19:25:48,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:25:48,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:25:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-12-02 19:25:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110304822] [2023-12-02 19:25:48,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:25:48,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 19:25:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:25:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 19:25:48,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2476, Unknown=2, NotChecked=0, Total=2756 [2023-12-02 19:25:48,847 INFO L87 Difference]: Start difference. First operand 214 states and 277 transitions. Second operand has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:51,800 INFO L93 Difference]: Finished difference Result 247 states and 295 transitions. [2023-12-02 19:25:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 19:25:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-12-02 19:25:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:51,802 INFO L225 Difference]: With dead ends: 247 [2023-12-02 19:25:51,803 INFO L226 Difference]: Without dead ends: 247 [2023-12-02 19:25:51,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=539, Invalid=4428, Unknown=3, NotChecked=0, Total=4970 [2023-12-02 19:25:51,804 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 676 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:51,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 392 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 19:25:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-02 19:25:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 223. [2023-12-02 19:25:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.5869565217391304) internal successors, (292), 222 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 292 transitions. [2023-12-02 19:25:51,808 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 292 transitions. Word has length 45 [2023-12-02 19:25:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:51,808 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 292 transitions. [2023-12-02 19:25:51,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 292 transitions. [2023-12-02 19:25:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 19:25:51,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:51,809 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:51,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 19:25:52,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 19:25:52,010 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:25:52,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1574088272, now seen corresponding path program 1 times [2023-12-02 19:25:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:25:52,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803398621] [2023-12-02 19:25:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:25:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:25:52,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:25:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803398621] [2023-12-02 19:25:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803398621] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:25:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124742566] [2023-12-02 19:25:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:52,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:25:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:25:52,207 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:25:52,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 19:25:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:52,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 19:25:52,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 19:25:52,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:52,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124742566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:52,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:25:52,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-12-02 19:25:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516791668] [2023-12-02 19:25:52,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:52,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:25:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:25:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:25:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:25:52,603 INFO L87 Difference]: Start difference. First operand 223 states and 292 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:53,097 INFO L93 Difference]: Finished difference Result 247 states and 314 transitions. [2023-12-02 19:25:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:25:53,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 45 [2023-12-02 19:25:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:53,099 INFO L225 Difference]: With dead ends: 247 [2023-12-02 19:25:53,099 INFO L226 Difference]: Without dead ends: 247 [2023-12-02 19:25:53,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:25:53,100 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 214 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:53,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 90 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:25:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-02 19:25:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2023-12-02 19:25:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.56) internal successors, (312), 234 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 312 transitions. [2023-12-02 19:25:53,106 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 312 transitions. Word has length 45 [2023-12-02 19:25:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:53,106 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 312 transitions. [2023-12-02 19:25:53,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 312 transitions. [2023-12-02 19:25:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 19:25:53,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:53,107 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:53,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 19:25:53,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-02 19:25:53,308 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-12-02 19:25:53,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1574224892, now seen corresponding path program 1 times [2023-12-02 19:25:53,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:25:53,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569901990] [2023-12-02 19:25:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:25:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:54,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:25:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569901990] [2023-12-02 19:25:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569901990] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:25:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785631447] [2023-12-02 19:25:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:54,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:25:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:25:54,634 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:25:54,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1bce162-263a-44bf-8899-b9f711e0f351/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 19:25:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:54,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 19:25:54,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:54,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:25:55,100 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:25:55,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 19:25:55,446 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-12-02 19:25:55,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 19:25:55,866 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 11 treesize of output 7 [2023-12-02 19:25:56,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2023-12-02 19:25:56,830 INFO L349 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2023-12-02 19:25:56,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 39 [2023-12-02 19:25:56,840 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 20 treesize of output 12 [2023-12-02 19:25:57,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-12-02 19:25:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:57,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:25:58,533 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 8 treesize of output 4 [2023-12-02 19:25:58,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:25:58,826 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 650 treesize of output 642 [2023-12-02 19:26:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785631447] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:26:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [268279706] [2023-12-02 19:26:03,780 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 19:26:03,780 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:26:03,780 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:26:03,780 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:26:03,780 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs