./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E --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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:51:00,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:51:00,925 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 02:51:00,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:51:00,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:51:00,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:51:00,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:51:00,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:51:00,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:51:00,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:51:00,968 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:51:00,968 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:51:00,968 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:51:00,968 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:51:00,970 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:51:00,970 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:51:00,970 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:51:00,970 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:51:00,971 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:51:00,971 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:51:00,971 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:51:00,971 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:51:00,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 02:51:00,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 02:51:00,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:51:00,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:51:00,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:51:00,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:51:00,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:51:00,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:51:00,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:51:00,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:51:00,975 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2024-11-14 02:51:01,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:51:01,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:51:01,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:51:01,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:51:01,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:51:01,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-reverse.i Unable to find full path for "g++" [2024-11-14 02:51:03,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:51:03,404 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:51:03,405 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/sv-benchmarks/c/forester-heap/dll-reverse.i [2024-11-14 02:51:03,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/data/ec9fde74d/5418555ab1814619abd9893cf0c024b2/FLAGbb051b73f [2024-11-14 02:51:03,432 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/data/ec9fde74d/5418555ab1814619abd9893cf0c024b2 [2024-11-14 02:51:03,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:51:03,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:51:03,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:51:03,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:51:03,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:51:03,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:03,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b1365c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03, skipping insertion in model container [2024-11-14 02:51:03,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:03,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:51:03,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:51:03,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:51:03,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:51:03,991 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:51:03,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03 WrapperNode [2024-11-14 02:51:03,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:51:03,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:51:03,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:51:03,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:51:04,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,031 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2024-11-14 02:51:04,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:51:04,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:51:04,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:51:04,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:51:04,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:51:04,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:51:04,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:51:04,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:51:04,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (1/1) ... [2024-11-14 02:51:04,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:51:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:51:04,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:51:04,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:51:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 02:51:04,132 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:51:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:51:04,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:51:04,260 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:51:04,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:51:04,894 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-11-14 02:51:04,895 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:51:05,000 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:51:05,000 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-14 02:51:05,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:51:05 BoogieIcfgContainer [2024-11-14 02:51:05,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:51:05,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:51:05,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:51:05,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:51:05,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:51:03" (1/3) ... [2024-11-14 02:51:05,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1395e1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:51:05, skipping insertion in model container [2024-11-14 02:51:05,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:51:03" (2/3) ... [2024-11-14 02:51:05,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1395e1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:51:05, skipping insertion in model container [2024-11-14 02:51:05,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:51:05" (3/3) ... [2024-11-14 02:51:05,009 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2024-11-14 02:51:05,024 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:51:05,026 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-reverse.i that has 2 procedures, 131 locations, 1 initial locations, 8 loop locations, and 67 error locations. [2024-11-14 02:51:05,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:51:05,077 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5161320c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:51:05,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-11-14 02:51:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 59 states have (on average 2.4745762711864407) internal successors, (146), 126 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 02:51:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 02:51:05,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:05,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 02:51:05,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:05,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash 9964, now seen corresponding path program 1 times [2024-11-14 02:51:05,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817465209] [2024-11-14 02:51:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:05,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817465209] [2024-11-14 02:51:05,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817465209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:05,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:05,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 02:51:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558872829] [2024-11-14 02:51:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:05,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:51:05,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:05,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:51:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:51:05,334 INFO L87 Difference]: Start difference. First operand has 131 states, 59 states have (on average 2.4745762711864407) internal successors, (146), 126 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:05,567 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-14 02:51:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:51:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-14 02:51:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:05,576 INFO L225 Difference]: With dead ends: 123 [2024-11-14 02:51:05,576 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 02:51:05,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:51:05,581 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:05,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 98 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 02:51:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-14 02:51:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 55 states have (on average 2.327272727272727) internal successors, (128), 120 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2024-11-14 02:51:05,620 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 2 [2024-11-14 02:51:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:05,621 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2024-11-14 02:51:05,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2024-11-14 02:51:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 02:51:05,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:05,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 02:51:05,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:51:05,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:05,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash 9965, now seen corresponding path program 1 times [2024-11-14 02:51:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723752813] [2024-11-14 02:51:05,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:05,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723752813] [2024-11-14 02:51:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723752813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:05,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 02:51:05,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596827186] [2024-11-14 02:51:05,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:05,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:51:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:51:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:51:05,720 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:05,896 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2024-11-14 02:51:05,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:51:05,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-14 02:51:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:05,897 INFO L225 Difference]: With dead ends: 119 [2024-11-14 02:51:05,897 INFO L226 Difference]: Without dead ends: 119 [2024-11-14 02:51:05,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:51:05,898 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 97 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.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:05,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 97 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-14 02:51:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-14 02:51:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 55 states have (on average 2.272727272727273) internal successors, (125), 117 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-11-14 02:51:05,913 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 2 [2024-11-14 02:51:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:05,913 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-11-14 02:51:05,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2024-11-14 02:51:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 02:51:05,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:05,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:05,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 02:51:05,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:05,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1786609159, now seen corresponding path program 1 times [2024-11-14 02:51:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663273321] [2024-11-14 02:51:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:06,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663273321] [2024-11-14 02:51:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663273321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:06,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:06,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:51:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893558082] [2024-11-14 02:51:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:06,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:51:06,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:06,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:51:06,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:51:06,195 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:06,466 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2024-11-14 02:51:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:51:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 02:51:06,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:06,468 INFO L225 Difference]: With dead ends: 106 [2024-11-14 02:51:06,469 INFO L226 Difference]: Without dead ends: 106 [2024-11-14 02:51:06,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:06,471 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 96 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:06,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 62 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-14 02:51:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-14 02:51:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 104 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2024-11-14 02:51:06,482 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 7 [2024-11-14 02:51:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2024-11-14 02:51:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2024-11-14 02:51:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 02:51:06,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:06,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 02:51:06,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:06,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1786609160, now seen corresponding path program 1 times [2024-11-14 02:51:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375854013] [2024-11-14 02:51:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:06,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:06,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375854013] [2024-11-14 02:51:06,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375854013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:06,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:06,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:51:06,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810977275] [2024-11-14 02:51:06,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 02:51:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:06,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 02:51:06,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:51:06,831 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:07,175 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2024-11-14 02:51:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:51:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 02:51:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:07,176 INFO L225 Difference]: With dead ends: 135 [2024-11-14 02:51:07,176 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 02:51:07,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:51:07,177 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 136 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:07,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 98 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:51:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 02:51:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2024-11-14 02:51:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.7901234567901234) internal successors, (145), 126 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 148 transitions. [2024-11-14 02:51:07,184 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 148 transitions. Word has length 7 [2024-11-14 02:51:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:07,184 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 148 transitions. [2024-11-14 02:51:07,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2024-11-14 02:51:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 02:51:07,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:07,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:07,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 02:51:07,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:07,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1055271383, now seen corresponding path program 1 times [2024-11-14 02:51:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:07,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087826849] [2024-11-14 02:51:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:07,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:07,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087826849] [2024-11-14 02:51:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087826849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:51:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920199129] [2024-11-14 02:51:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:51:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:07,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:51:07,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:07,335 INFO L87 Difference]: Start difference. First operand 128 states and 148 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:07,537 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-11-14 02:51:07,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:51:07,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 02:51:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:07,538 INFO L225 Difference]: With dead ends: 127 [2024-11-14 02:51:07,538 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 02:51:07,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:51:07,539 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:07,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 225 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 02:51:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-14 02:51:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.7654320987654322) internal successors, (143), 125 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2024-11-14 02:51:07,550 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 9 [2024-11-14 02:51:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:07,553 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2024-11-14 02:51:07,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2024-11-14 02:51:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 02:51:07,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:07,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:07,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 02:51:07,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:07,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1055271382, now seen corresponding path program 1 times [2024-11-14 02:51:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:07,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078458473] [2024-11-14 02:51:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:07,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078458473] [2024-11-14 02:51:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078458473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:51:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588935259] [2024-11-14 02:51:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:07,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:51:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:51:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:07,875 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:08,116 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2024-11-14 02:51:08,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:51:08,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 02:51:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:08,119 INFO L225 Difference]: With dead ends: 126 [2024-11-14 02:51:08,119 INFO L226 Difference]: Without dead ends: 126 [2024-11-14 02:51:08,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:51:08,120 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:08,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-14 02:51:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-14 02:51:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.7407407407407407) internal successors, (141), 124 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-11-14 02:51:08,133 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 9 [2024-11-14 02:51:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:08,133 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-11-14 02:51:08,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-11-14 02:51:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 02:51:08,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:08,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:08,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 02:51:08,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash -503269903, now seen corresponding path program 1 times [2024-11-14 02:51:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:08,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673695604] [2024-11-14 02:51:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:08,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673695604] [2024-11-14 02:51:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673695604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:08,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:08,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 02:51:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466020446] [2024-11-14 02:51:08,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:08,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:51:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:51:08,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:51:08,617 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:09,156 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2024-11-14 02:51:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 02:51:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 02:51:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:09,157 INFO L225 Difference]: With dead ends: 122 [2024-11-14 02:51:09,157 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 02:51:09,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-14 02:51:09,158 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 94 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:09,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 147 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:51:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 02:51:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2024-11-14 02:51:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.72) internal successors, (129), 113 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2024-11-14 02:51:09,174 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 11 [2024-11-14 02:51:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:09,175 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2024-11-14 02:51:09,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2024-11-14 02:51:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 02:51:09,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:09,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:09,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 02:51:09,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -503269904, now seen corresponding path program 1 times [2024-11-14 02:51:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:09,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037634904] [2024-11-14 02:51:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:09,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:09,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:09,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037634904] [2024-11-14 02:51:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037634904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:09,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 02:51:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176845580] [2024-11-14 02:51:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:09,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 02:51:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 02:51:09,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:51:09,427 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:09,766 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2024-11-14 02:51:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:51:09,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 02:51:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:09,767 INFO L225 Difference]: With dead ends: 114 [2024-11-14 02:51:09,767 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 02:51:09,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-14 02:51:09,768 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 87 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:09,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 109 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:51:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 02:51:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-14 02:51:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 112 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-11-14 02:51:09,772 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 11 [2024-11-14 02:51:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:09,772 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-14 02:51:09,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-14 02:51:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 02:51:09,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:09,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:09,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 02:51:09,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:09,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:09,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2002746840, now seen corresponding path program 1 times [2024-11-14 02:51:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:09,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462207308] [2024-11-14 02:51:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:09,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462207308] [2024-11-14 02:51:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462207308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:51:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240836525] [2024-11-14 02:51:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:09,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:51:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:51:09,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:51:09,821 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:09,980 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-11-14 02:51:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:51:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 02:51:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:09,981 INFO L225 Difference]: With dead ends: 123 [2024-11-14 02:51:09,981 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 02:51:09,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:09,981 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 94 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:09,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 138 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:51:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 02:51:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2024-11-14 02:51:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 112 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2024-11-14 02:51:09,986 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2024-11-14 02:51:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:09,986 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2024-11-14 02:51:09,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2024-11-14 02:51:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 02:51:09,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:09,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:09,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 02:51:09,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:09,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2001663056, now seen corresponding path program 1 times [2024-11-14 02:51:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160799982] [2024-11-14 02:51:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:10,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160799982] [2024-11-14 02:51:10,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160799982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:10,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:10,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:51:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035584058] [2024-11-14 02:51:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:10,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:51:10,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:51:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:10,283 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:10,483 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2024-11-14 02:51:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:51:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 02:51:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:10,484 INFO L225 Difference]: With dead ends: 127 [2024-11-14 02:51:10,484 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 02:51:10,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:51:10,485 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 19 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:10,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 235 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 02:51:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2024-11-14 02:51:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.6375) internal successors, (131), 117 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-11-14 02:51:10,492 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 13 [2024-11-14 02:51:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:10,492 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-11-14 02:51:10,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-11-14 02:51:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 02:51:10,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:10,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:10,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 02:51:10,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 959521840, now seen corresponding path program 1 times [2024-11-14 02:51:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650225202] [2024-11-14 02:51:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:10,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650225202] [2024-11-14 02:51:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650225202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:10,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:51:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473045161] [2024-11-14 02:51:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:51:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:51:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:10,830 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:11,037 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2024-11-14 02:51:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:51:11,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 02:51:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:11,038 INFO L225 Difference]: With dead ends: 126 [2024-11-14 02:51:11,038 INFO L226 Difference]: Without dead ends: 126 [2024-11-14 02:51:11,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:51:11,039 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:11,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-14 02:51:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-14 02:51:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2024-11-14 02:51:11,042 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 16 [2024-11-14 02:51:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:11,043 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2024-11-14 02:51:11,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2024-11-14 02:51:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 02:51:11,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:11,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:11,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 02:51:11,043 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash -320151031, now seen corresponding path program 1 times [2024-11-14 02:51:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011792945] [2024-11-14 02:51:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:11,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:11,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011792945] [2024-11-14 02:51:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011792945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:11,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:51:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409128639] [2024-11-14 02:51:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:11,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:51:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:11,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:51:11,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:11,169 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:11,354 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-11-14 02:51:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:51:11,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 02:51:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:11,355 INFO L225 Difference]: With dead ends: 123 [2024-11-14 02:51:11,355 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 02:51:11,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:51:11,356 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:11,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 02:51:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-14 02:51:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.576470588235294) internal successors, (134), 121 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2024-11-14 02:51:11,360 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 17 [2024-11-14 02:51:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:11,360 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2024-11-14 02:51:11,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2024-11-14 02:51:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 02:51:11,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:11,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:11,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 02:51:11,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -320151030, now seen corresponding path program 1 times [2024-11-14 02:51:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726135393] [2024-11-14 02:51:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:11,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:11,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726135393] [2024-11-14 02:51:11,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726135393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:11,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:11,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:51:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448920602] [2024-11-14 02:51:11,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:11,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:51:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:51:11,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:51:11,530 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:11,727 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2024-11-14 02:51:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:51:11,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 02:51:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:11,728 INFO L225 Difference]: With dead ends: 122 [2024-11-14 02:51:11,728 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 02:51:11,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:51:11,729 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:11,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 192 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:51:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 02:51:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-14 02:51:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 120 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-14 02:51:11,732 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 17 [2024-11-14 02:51:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:11,733 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-14 02:51:11,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-14 02:51:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 02:51:11,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:11,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 02:51:11,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1572657616, now seen corresponding path program 1 times [2024-11-14 02:51:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113067252] [2024-11-14 02:51:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:11,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113067252] [2024-11-14 02:51:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113067252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:11,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 02:51:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118148705] [2024-11-14 02:51:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 02:51:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 02:51:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:51:11,991 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:12,339 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2024-11-14 02:51:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:51:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 02:51:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:12,341 INFO L225 Difference]: With dead ends: 121 [2024-11-14 02:51:12,341 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 02:51:12,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-14 02:51:12,342 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:12,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 127 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:51:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 02:51:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-14 02:51:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 119 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2024-11-14 02:51:12,347 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 19 [2024-11-14 02:51:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:12,347 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2024-11-14 02:51:12,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2024-11-14 02:51:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 02:51:12,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:12,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:12,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 02:51:12,348 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:12,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1572657617, now seen corresponding path program 1 times [2024-11-14 02:51:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188884970] [2024-11-14 02:51:12,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:12,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188884970] [2024-11-14 02:51:12,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188884970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:51:12,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:51:12,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 02:51:12,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974376693] [2024-11-14 02:51:12,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:51:12,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:51:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:51:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:51:12,709 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:13,153 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2024-11-14 02:51:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 02:51:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 02:51:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:13,155 INFO L225 Difference]: With dead ends: 119 [2024-11-14 02:51:13,155 INFO L226 Difference]: Without dead ends: 119 [2024-11-14 02:51:13,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-14 02:51:13,156 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 72 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:13,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 165 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:51:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-14 02:51:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-14 02:51:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2024-11-14 02:51:13,159 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 19 [2024-11-14 02:51:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:13,160 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2024-11-14 02:51:13,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:51:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2024-11-14 02:51:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 02:51:13,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:13,160 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:13,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 02:51:13,161 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:51:13,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash 139193954, now seen corresponding path program 1 times [2024-11-14 02:51:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:13,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111434157] [2024-11-14 02:51:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:13,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111434157] [2024-11-14 02:51:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111434157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:51:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177608474] [2024-11-14 02:51:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:13,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:51:13,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:51:13,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:51:13,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:51:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:13,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 02:51:13,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:51:13,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:51:13,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 02:51:13,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 02:51:13,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:51:14,041 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:51:14,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 02:51:14,138 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 02:51:14,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 02:51:14,168 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:51:14,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 02:51:14,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 25 treesize of output 13 [2024-11-14 02:51:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:14,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:51:14,638 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-14 02:51:14,639 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 29 treesize of output 28 [2024-11-14 02:51:14,740 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_482 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int) (v_ArrVal_484 (Array Int Int))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_482))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_484)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|))) is different from false [2024-11-14 02:51:14,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:51:14,760 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 36 treesize of output 29 [2024-11-14 02:51:14,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:51:14,779 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 136 treesize of output 123 [2024-11-14 02:51:14,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:51:14,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2024-11-14 02:51:14,827 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 62 treesize of output 58 [2024-11-14 02:51:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:51:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177608474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:51:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790492389] [2024-11-14 02:51:15,336 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 02:51:15,336 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:51:15,340 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:51:15,344 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:51:15,344 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:51:22,742 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:52:06,454 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4068#(exists ((|v_ULTIMATE.start_main_~x~0#1.base_175| Int)) (and (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_148| Int) (|v_ULTIMATE.start_main_~x~0#1.base_174| Int)) (and (= |v_ULTIMATE.start_main_~x~0#1.base_175| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_174|) |v_ULTIMATE.start_main_~x~0#1.offset_148|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_174|) |v_ULTIMATE.start_main_~x~0#1.offset_148|) |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_174|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_148|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_174|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_148|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (= |v_ULTIMATE.start_main_~x~0#1.base_175| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_171| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_145| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_145|) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_145|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_171|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_171|) 1) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_20| Int) (|v_ULTIMATE.start_main_#t~mem4#1.offset_18| Int) (|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int)))) (and (<= 1 |#StackHeapBarrier|) (= |v_ULTIMATE.start_main_~x~0#1.base_171| (select (select |v_#memory_$Pointer$.base_110| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (= |v_ULTIMATE.start_main_~x~0#1.offset_145| (select (select |v_#memory_$Pointer$.offset_106| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_~x~0#1.base_171| (store (store (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_~x~0#1.base_171|) |v_ULTIMATE.start_main_~x~0#1.offset_145| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_145|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_171|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_145|))))) (= (store |v_#memory_$Pointer$.base_109| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_$Pointer$.base_109| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_$Pointer$.base_110|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~x~0#1.base_171| (store (store (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~x~0#1.base_171|) |v_ULTIMATE.start_main_~x~0#1.offset_145| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_145|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_171|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_145|))))) (= (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_$Pointer$.offset_106|) (= |#memory_int| (store |v_#memory_int_86| |v_ULTIMATE.start_main_~x~0#1.base_171| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~x~0#1.base_171|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_145|) 0))) (= |v_#memory_int_86| (store |v_#memory_int_85| |v_ULTIMATE.start_main_~x~0#1.base_171| (store (select |v_#memory_int_85| |v_ULTIMATE.start_main_~x~0#1.base_171|) |v_ULTIMATE.start_main_~x~0#1.offset_145| (select (select |v_#memory_int_86| |v_ULTIMATE.start_main_~x~0#1.base_171|) |v_ULTIMATE.start_main_~x~0#1.offset_145|)))) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) 1) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_18|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_20|)) (<= 0 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)) (<= (+ (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (= (store |v_#memory_int_84| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_int_85| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_int_85|))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_175|) 1))))' at error location [2024-11-14 02:52:06,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:52:06,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:52:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-11-14 02:52:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105752065] [2024-11-14 02:52:06,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:52:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 02:52:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:52:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 02:52:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1779, Unknown=24, NotChecked=86, Total=2070 [2024-11-14 02:52:06,457 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:52:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:52:08,185 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2024-11-14 02:52:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 02:52:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 02:52:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:52:08,186 INFO L225 Difference]: With dead ends: 185 [2024-11-14 02:52:08,186 INFO L226 Difference]: Without dead ends: 185 [2024-11-14 02:52:08,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=288, Invalid=2344, Unknown=24, NotChecked=100, Total=2756 [2024-11-14 02:52:08,188 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 445 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:52:08,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 435 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1427 Invalid, 0 Unknown, 195 Unchecked, 1.3s Time] [2024-11-14 02:52:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-14 02:52:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 134. [2024-11-14 02:52:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 100 states have (on average 1.47) internal successors, (147), 132 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:52:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2024-11-14 02:52:08,193 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 21 [2024-11-14 02:52:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:52:08,193 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2024-11-14 02:52:08,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:52:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2024-11-14 02:52:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 02:52:08,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:52:08,194 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:52:08,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:52:08,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 02:52:08,398 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:52:08,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:52:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 139193955, now seen corresponding path program 1 times [2024-11-14 02:52:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:52:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150082386] [2024-11-14 02:52:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:52:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:52:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:52:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:52:08,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:52:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150082386] [2024-11-14 02:52:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150082386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:52:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293639262] [2024-11-14 02:52:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:52:08,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:52:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:52:08,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:52:08,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:52:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:52:09,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 02:52:09,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:52:09,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:52:09,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 8 treesize of output 1 [2024-11-14 02:52:09,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 02:52:09,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 02:52:09,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:52:09,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 [2024-11-14 02:52:09,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:09,322 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 55 treesize of output 37 [2024-11-14 02:52:09,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 02:52:09,509 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 02:52:09,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 02:52:09,539 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-14 02:52:09,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-11-14 02:52:09,543 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 3 [2024-11-14 02:52:09,612 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:52:09,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 02:52:09,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 24 treesize of output 11 [2024-11-14 02:52:09,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 02:52:09,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 02:52:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:52:09,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:52:10,067 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_152| Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_152|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_152|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_152|) (< |v_ULTIMATE.start_main_~x~0#1.offset_152| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_152| Int) (v_ArrVal_587 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_152|) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_152|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_152| 0)))) is different from false [2024-11-14 02:52:10,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:52:10,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-11-14 02:52:10,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:52:10,733 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 104 treesize of output 103 [2024-11-14 02:52:10,744 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 88 treesize of output 82 [2024-11-14 02:52:10,752 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 51 [2024-11-14 02:52:10,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:52:10,879 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 118 treesize of output 119 [2024-11-14 02:52:10,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:10,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:52:10,892 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 29 treesize of output 30 [2024-11-14 02:52:10,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:10,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:10,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:10,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 02:52:10,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:10,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:10,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:10,913 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-14 02:52:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:52:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293639262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:52:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [442327058] [2024-11-14 02:52:11,263 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 02:52:11,263 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:52:11,263 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:52:11,263 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:52:11,263 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:52:17,462 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:53:21,153 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4572#(exists ((|v_ULTIMATE.start_main_~x~0#1.base_189| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_161| Int)) (and (or (< (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_189|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_161|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_161| 0)) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_157| Int) (|v_ULTIMATE.start_main_~x~0#1.base_185| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_157|) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.offset_23| Int) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_132| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_25| Int)) (and (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_23|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_25|)) (= |#memory_int| (store |v_#memory_int_109| |v_ULTIMATE.start_main_~x~0#1.base_185| (store (select |v_#memory_int_109| |v_ULTIMATE.start_main_~x~0#1.base_185|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_157|) 0))) (= |v_#memory_$Pointer$.base_137| (store |v_#memory_$Pointer$.base_136| |v_ULTIMATE.start_main_#t~mem4#1.base_25| (store (select |v_#memory_$Pointer$.base_136| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4) (select (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))))) (<= 1 |#StackHeapBarrier|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) 1) (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~x~0#1.base_185| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~x~0#1.base_185|) |v_ULTIMATE.start_main_~x~0#1.offset_157| (select (select |v_#memory_int_109| |v_ULTIMATE.start_main_~x~0#1.base_185|) |v_ULTIMATE.start_main_~x~0#1.offset_157|))) |v_#memory_int_109|) (<= (+ (select (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)) (= (store |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_main_~x~0#1.base_185| (store (store (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_main_~x~0#1.base_185|) |v_ULTIMATE.start_main_~x~0#1.offset_157| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_157|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_185|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_157|)))) |#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.offset_133| (store |v_#memory_$Pointer$.offset_132| |v_ULTIMATE.start_main_#t~mem4#1.base_25| (store (select |v_#memory_$Pointer$.offset_132| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4) (select (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))))) (<= 0 (select (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_main_~x~0#1.base_185| (store (store (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_main_~x~0#1.base_185|) |v_ULTIMATE.start_main_~x~0#1.offset_157| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_157|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_185|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_157|))))) (= |v_ULTIMATE.start_main_~x~0#1.base_185| (select (select |v_#memory_$Pointer$.base_137| (select (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) (select (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) 1) (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_#t~mem4#1.base_25| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4) (select (select |v_#memory_int_108| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))) |v_#memory_int_108|) (= |v_ULTIMATE.start_main_~x~0#1.offset_157| (select (select |v_#memory_$Pointer$.offset_133| (select (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) (select (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_185|) 1) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_157|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_185|)))) (= |ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_161|) (= |v_ULTIMATE.start_main_~x~0#1.base_189| |ULTIMATE.start_main_~head~0#1.base|)) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_188| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_160| Int)) (and (= |v_ULTIMATE.start_main_~x~0#1.base_189| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_188|) |v_ULTIMATE.start_main_~x~0#1.offset_160|)) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_160|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_188|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_188|) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_160|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_188|) |v_ULTIMATE.start_main_~x~0#1.offset_160|) |v_ULTIMATE.start_main_~x~0#1.offset_161|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)))))' at error location [2024-11-14 02:53:21,153 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:53:21,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:53:21,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 33 [2024-11-14 02:53:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709139177] [2024-11-14 02:53:21,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:53:21,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 02:53:21,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:53:21,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 02:53:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2108, Unknown=40, NotChecked=94, Total=2450 [2024-11-14 02:53:21,156 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:53:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:53:23,869 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2024-11-14 02:53:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 02:53:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 02:53:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:53:23,871 INFO L225 Difference]: With dead ends: 185 [2024-11-14 02:53:23,871 INFO L226 Difference]: Without dead ends: 185 [2024-11-14 02:53:23,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=457, Invalid=3283, Unknown=46, NotChecked=120, Total=3906 [2024-11-14 02:53:23,872 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 602 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 02:53:23,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 572 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1451 Invalid, 0 Unknown, 191 Unchecked, 1.7s Time] [2024-11-14 02:53:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-14 02:53:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2024-11-14 02:53:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 128 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:53:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2024-11-14 02:53:23,877 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 21 [2024-11-14 02:53:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:53:23,878 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2024-11-14 02:53:23,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:53:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2024-11-14 02:53:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 02:53:23,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:53:23,879 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:53:23,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 02:53:24,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 02:53:24,083 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:53:24,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:53:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1033638850, now seen corresponding path program 1 times [2024-11-14 02:53:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:53:24,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742926576] [2024-11-14 02:53:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:53:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:53:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:53:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:53:24,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:53:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742926576] [2024-11-14 02:53:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742926576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:53:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020689419] [2024-11-14 02:53:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:53:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:53:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:53:24,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:53:24,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 02:53:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:53:24,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 02:53:24,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:53:24,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:53:24,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 02:53:24,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 02:53:24,814 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 [2024-11-14 02:53:24,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:53:24,867 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 15 treesize of output 7 [2024-11-14 02:53:24,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:24,932 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 30 treesize of output 24 [2024-11-14 02:53:25,057 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-14 02:53:25,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 29 [2024-11-14 02:53:25,061 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 3 [2024-11-14 02:53:25,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:53:25,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 02:53:25,254 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 33 treesize of output 17 [2024-11-14 02:53:25,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 02:53:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:53:25,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:53:25,491 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-14 02:53:25,491 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 19 treesize of output 18 [2024-11-14 02:53:25,869 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 02:53:25,869 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 2 case distinctions, treesize of input 107 treesize of output 113 [2024-11-14 02:53:25,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:53:25,899 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 125 treesize of output 141 [2024-11-14 02:53:25,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2024-11-14 02:53:26,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 02:53:26,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:53:26,089 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 21 treesize of output 25 [2024-11-14 02:53:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:53:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020689419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:53:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482528974] [2024-11-14 02:53:26,360 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 02:53:26,360 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:53:26,360 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:53:26,360 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:53:26,360 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:53:29,562 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:55:48,283 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5099#(and (exists ((|v_#memory_$Pointer$.base_172| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_200| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_171| Int) (|v_#memory_int_138| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_164| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_138| |v_ULTIMATE.start_main_~x~0#1.base_200| (store (select |v_#memory_int_138| |v_ULTIMATE.start_main_~x~0#1.base_200|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_171|) 1)) |#memory_int|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_171|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_200|) |v_ULTIMATE.start_main_~x~0#1.offset_171|) |ULTIMATE.start_main_#t~mem14#1.offset|) (= (store |v_#memory_$Pointer$.base_172| |v_ULTIMATE.start_main_~x~0#1.base_200| (store (select |v_#memory_$Pointer$.base_172| |v_ULTIMATE.start_main_~x~0#1.base_200|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_171|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_200|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_171|)))) |#memory_$Pointer$.base|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_200|) |v_ULTIMATE.start_main_~x~0#1.offset_171|)) 1)) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_171|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_200|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_200|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_164| |v_ULTIMATE.start_main_~x~0#1.base_200| (store (select |v_#memory_$Pointer$.offset_164| |v_ULTIMATE.start_main_~x~0#1.base_200|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_171|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_200|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_171|))))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_200|) |v_ULTIMATE.start_main_~x~0#1.offset_171|) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_200|) |v_ULTIMATE.start_main_~x~0#1.offset_171|) 0))))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))' at error location [2024-11-14 02:55:48,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:55:48,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:55:48,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2024-11-14 02:55:48,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247008508] [2024-11-14 02:55:48,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:55:48,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 02:55:48,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:55:48,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 02:55:48,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2388, Unknown=65, NotChecked=0, Total=2652 [2024-11-14 02:55:48,285 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:55:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:55:57,579 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2024-11-14 02:55:57,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 02:55:57,580 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 02:55:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:55:57,581 INFO L225 Difference]: With dead ends: 180 [2024-11-14 02:55:57,581 INFO L226 Difference]: Without dead ends: 180 [2024-11-14 02:55:57,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 147.6s TimeCoverageRelationStatistics Valid=349, Invalid=3243, Unknown=68, NotChecked=0, Total=3660 [2024-11-14 02:55:57,582 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 461 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:55:57,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 541 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 02:55:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-14 02:55:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 137. [2024-11-14 02:55:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.4311926605504588) internal successors, (156), 135 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:55:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2024-11-14 02:55:57,587 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 24 [2024-11-14 02:55:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:55:57,588 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2024-11-14 02:55:57,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:55:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2024-11-14 02:55:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 02:55:57,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:55:57,589 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:55:57,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 02:55:57,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 02:55:57,793 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:55:57,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:55:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1033638849, now seen corresponding path program 1 times [2024-11-14 02:55:57,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:55:57,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957074171] [2024-11-14 02:55:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:55:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:55:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:55:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:55:58,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:55:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957074171] [2024-11-14 02:55:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957074171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:55:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279148237] [2024-11-14 02:55:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:55:58,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:55:58,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:55:58,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:55:58,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 02:55:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:55:58,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 02:55:58,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:55:58,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:55:58,728 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 8 treesize of output 1 [2024-11-14 02:55:58,753 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 02:55:58,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 02:55:58,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:55:58,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:55:58,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:55:58,964 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 55 treesize of output 37 [2024-11-14 02:55:58,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 02:55:59,166 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 02:55:59,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 02:55:59,202 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-14 02:55:59,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-11-14 02:55:59,208 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 3 [2024-11-14 02:55:59,291 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:55:59,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 02:55:59,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 02:55:59,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 02:55:59,535 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 33 treesize of output 17 [2024-11-14 02:55:59,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 02:55:59,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 02:55:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:55:59,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:55:59,933 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_174| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_174|) (< |v_ULTIMATE.start_main_~x~0#1.offset_174| 0) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_174|))))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_174| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_174|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_174|) (< |v_ULTIMATE.start_main_~x~0#1.offset_174| 0)))) is different from false [2024-11-14 02:56:00,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:56:00,475 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 118 treesize of output 119 [2024-11-14 02:56:00,518 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 02:56:00,518 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 2 case distinctions, treesize of input 174 treesize of output 180 [2024-11-14 02:56:00,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:56:00,545 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 428 treesize of output 415 [2024-11-14 02:56:00,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:56:00,578 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 199 treesize of output 213 [2024-11-14 02:56:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2024-11-14 02:56:00,602 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 125 treesize of output 119 [2024-11-14 02:56:00,615 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 119 treesize of output 113 [2024-11-14 02:56:00,702 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 [2024-11-14 02:56:00,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:56:00,760 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 35 [2024-11-14 02:56:00,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:56:00,814 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 53 treesize of output 54 [2024-11-14 02:56:00,820 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:56:00,824 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:56:00,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:56:00,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:56:00,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 02:56:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:56:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279148237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:56:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874533858] [2024-11-14 02:56:01,099 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 02:56:01,099 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:56:01,099 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:56:01,100 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:56:01,100 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:56:06,214 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:58:43,003 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5625#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_211| Int) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_181| Int) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_198| (Array Int (Array Int Int)))) (and (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_211|) 1) (= |#memory_int| (store |v_#memory_int_167| |v_ULTIMATE.start_main_~x~0#1.base_211| (store (select |v_#memory_int_167| |v_ULTIMATE.start_main_~x~0#1.base_211|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_181|) 1))) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_211|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_211|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 12)) (< (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_211|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) 0)) (= (store |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~x~0#1.base_211| (store (select |v_#memory_$Pointer$.base_206| |v_ULTIMATE.start_main_~x~0#1.base_211|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_211|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_181|)))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_211| (store (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_211|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_211|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_181|))))) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_211|)) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_211|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_211|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 0))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_181|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))' at error location [2024-11-14 02:58:43,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:58:43,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 32 [2024-11-14 02:58:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504475276] [2024-11-14 02:58:43,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:43,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 02:58:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 02:58:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2340, Unknown=75, NotChecked=100, Total=2756 [2024-11-14 02:58:43,006 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:19,253 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2024-11-14 02:59:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 02:59:19,253 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 02:59:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:19,254 INFO L225 Difference]: With dead ends: 180 [2024-11-14 02:59:19,254 INFO L226 Difference]: Without dead ends: 180 [2024-11-14 02:59:19,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 192.8s TimeCoverageRelationStatistics Valid=368, Invalid=3087, Unknown=89, NotChecked=116, Total=3660 [2024-11-14 02:59:19,255 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 290 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:19,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 526 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1371 Invalid, 0 Unknown, 168 Unchecked, 1.6s Time] [2024-11-14 02:59:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-14 02:59:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 137. [2024-11-14 02:59:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.4220183486238531) internal successors, (155), 135 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2024-11-14 02:59:19,260 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 24 [2024-11-14 02:59:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2024-11-14 02:59:19,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2024-11-14 02:59:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 02:59:19,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:19,262 INFO L215 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] [2024-11-14 02:59:19,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 02:59:19,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:59:19,466 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 02:59:19,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash -867047966, now seen corresponding path program 1 times [2024-11-14 02:59:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:19,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909417892] [2024-11-14 02:59:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:19,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:59:19,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909417892] [2024-11-14 02:59:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909417892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:59:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527334180] [2024-11-14 02:59:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:19,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:59:19,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:59:19,616 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:59:19,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 02:59:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:19,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 02:59:19,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:59:19,776 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 [2024-11-14 02:59:19,791 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 [2024-11-14 02:59:19,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 02:59:19,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 02:59:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 02:59:19,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:59:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 02:59:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527334180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:59:19,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [787981483] [2024-11-14 02:59:19,907 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 02:59:19,911 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:59:19,911 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:59:19,912 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:59:19,912 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:59:26,147 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 137 for LOIs [2024-11-14 02:59:26,209 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:00:23,324 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6135#(exists ((|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| Int)) (and (<= 0 |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) (or (and (= (select |#valid| 0) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~nondet7#1_13| Int) (|v_ULTIMATE.start_main_#t~short8#1_18| Bool)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) |v_ULTIMATE.start_main_#t~short8#1_18|) (and (= (select (select |#memory_$Pointer$.offset| 0) 0) 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|) (= (select (select |#memory_$Pointer$.base| 0) 0) 0))) (or (= |v_ULTIMATE.start_main_#t~nondet7#1_13| 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|)))) (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| 0) (= |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 0) (<= 4 (select |#length| 0)) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_41| Int) (|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.offset_39| Int) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_220| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_main_#t~mem4#1.base_41| (store (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4) (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) |v_#memory_$Pointer$.base_228|) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_39|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_41|)) (= (store |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (store (store (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) 0) (+ 8 (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (+ 8 (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))))))) |#memory_$Pointer$.base|) (<= 0 (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (= (store |v_#memory_$Pointer$.offset_219| |v_ULTIMATE.start_main_#t~mem4#1.base_41| (store (select |v_#memory_$Pointer$.offset_219| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) |v_#memory_$Pointer$.offset_220|) (= (store |v_#memory_int_189| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (store (select |v_#memory_int_189| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_int_190| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))))) |v_#memory_int_190|) (<= (+ (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) 12) (select |#length| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))))) (= (store |v_#memory_int_190| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (store (select |v_#memory_int_190| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (+ 8 (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) 0)) |#memory_int|) (<= 0 (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (store (store (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) 0) (+ 8 (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) (+ 8 (select (select |v_#memory_$Pointer$.offset_220| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))))))) (= |v_#memory_int_189| (store |v_#memory_int_188| |v_ULTIMATE.start_main_#t~mem4#1.base_41| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4) (select (select |v_#memory_int_189| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) 1) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) 1) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_228| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))) (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)))) 1) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)) (<= (+ (select (select |v_#memory_$Pointer$.offset_220| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_228| |v_ULTIMATE.start_main_#t~mem4#1.base_41|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_39| 4))))))) (and (= (select |#valid| 0) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_222| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_192| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_192|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_192|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_222|)) (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_222|) |v_ULTIMATE.start_main_~x~0#1.offset_192|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_222|) 1) (= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_222|) |v_ULTIMATE.start_main_~x~0#1.offset_192|)))) (exists ((|v_ULTIMATE.start_main_#t~nondet7#1_13| Int) (|v_ULTIMATE.start_main_#t~short8#1_18| Bool)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) |v_ULTIMATE.start_main_#t~short8#1_18|) (and (= (select (select |#memory_$Pointer$.offset| 0) 0) 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|) (= (select (select |#memory_$Pointer$.base| 0) 0) 0))) (or (= |v_ULTIMATE.start_main_#t~nondet7#1_13| 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|)))) (<= 4 (select |#length| 0))))))' at error location [2024-11-14 03:00:23,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:00:23,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:00:23,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-11-14 03:00:23,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574429343] [2024-11-14 03:00:23,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:00:23,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:00:23,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:23,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:00:23,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=443, Unknown=22, NotChecked=0, Total=552 [2024-11-14 03:00:23,325 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:23,489 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2024-11-14 03:00:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:00:23,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-14 03:00:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:23,490 INFO L225 Difference]: With dead ends: 135 [2024-11-14 03:00:23,490 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 03:00:23,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 57.2s TimeCoverageRelationStatistics Valid=93, Invalid=485, Unknown=22, NotChecked=0, Total=600 [2024-11-14 03:00:23,491 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 222 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:23,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 40 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 03:00:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-11-14 03:00:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.4) internal successors, (147), 129 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2024-11-14 03:00:23,495 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 26 [2024-11-14 03:00:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:23,495 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2024-11-14 03:00:23,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2024-11-14 03:00:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:00:23,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:23,496 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:23,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:00:23,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:23,701 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-14 03:00:23,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash -865964182, now seen corresponding path program 2 times [2024-11-14 03:00:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419292843] [2024-11-14 03:00:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:00:24,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:24,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419292843] [2024-11-14 03:00:24,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419292843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:24,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971154035] [2024-11-14 03:00:24,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:00:24,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:24,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:24,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:24,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b806c24a-1a6e-490d-94b8-37eb863821f5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:00:24,922 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:00:24,922 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:00:24,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 03:00:24,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:24,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:00:25,032 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:00:25,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:00:25,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:00:25,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:00:25,236 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:00:25,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-14 03:00:25,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 03:00:25,337 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:00:25,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-14 03:00:25,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:00:25,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 19 treesize of output 18 [2024-11-14 03:00:25,440 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:00:25,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-14 03:00:25,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 25 [2024-11-14 03:00:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:00:25,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:26,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (or (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1015)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) 0))) (not (= v_ArrVal_1014 (store .cse3 .cse2 (select v_ArrVal_1014 .cse2)))))) (forall ((v_ArrVal_1014 (Array Int Int))) (or (not (= v_ArrVal_1014 (store .cse3 .cse2 (select v_ArrVal_1014 .cse2)))) (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1014))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1015)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) 0))))))) is different from false [2024-11-14 03:00:26,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (or (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1015)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (not (= v_ArrVal_1014 (store .cse3 .cse2 (select v_ArrVal_1014 .cse2)))))) (forall ((v_ArrVal_1014 (Array Int Int))) (or (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1014))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1015)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) 0))) (not (= v_ArrVal_1014 (store .cse3 .cse2 (select v_ArrVal_1014 .cse2)))))))) is different from false [2024-11-14 03:00:26,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 0)) (.cse2 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 0)) (.cse3 (+ 8 .cse6))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (or (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1014))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 .cse3 v_ArrVal_1015)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) 0))) (not (= v_ArrVal_1014 (store .cse4 .cse3 (select v_ArrVal_1014 .cse3)))))) (forall ((v_ArrVal_1014 (Array Int Int))) (or (not (= v_ArrVal_1014 (store .cse4 .cse3 (select v_ArrVal_1014 .cse3)))) (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|) (= (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 .cse3 v_ArrVal_1015)))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) 0)))))))) is different from false [2024-11-14 03:00:26,361 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1009))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1007))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ .cse2 8))) (or (not (= v_ArrVal_1014 (store (store (select .cse0 .cse1) .cse2 0) .cse3 (select v_ArrVal_1014 .cse3)))) (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|) (= (let ((.cse4 (store .cse5 .cse1 (store (store (select .cse5 .cse1) .cse2 0) .cse3 v_ArrVal_1015)))) (select (select .cse4 (select (select (store .cse0 .cse1 v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) 0)))))))) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1009))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1007))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse11 (+ .cse10 8))) (or (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|) (= (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1014))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (select (select (store .cse9 .cse8 (store (store (select .cse9 .cse8) .cse10 0) .cse11 v_ArrVal_1015)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) 0))) (not (= v_ArrVal_1014 (store (store (select .cse7 .cse8) .cse10 0) .cse11 (select v_ArrVal_1014 .cse11)))))))))) is different from false [2024-11-14 03:00:26,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1009))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1007))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (+ .cse4 8))) (or (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (= 0 (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1014))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (select (select (store .cse3 .cse2 (store (store (select .cse3 .cse2) .cse4 0) .cse5 v_ArrVal_1015)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (not (= (store (store (select .cse1 .cse2) .cse4 0) .cse5 (select v_ArrVal_1014 .cse5)) v_ArrVal_1014))))))) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1009))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1007))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse12 (+ .cse11 8))) (or (forall ((v_ArrVal_1015 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_197| 0) (= (let ((.cse7 (store .cse10 .cse9 (store (store (select .cse10 .cse9) .cse11 0) .cse12 v_ArrVal_1015)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|)) (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197|))) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|))) (not (= (store (store (select .cse8 .cse9) .cse11 0) .cse12 (select v_ArrVal_1014 .cse12)) v_ArrVal_1014))))))))) is different from false [2024-11-14 03:00:26,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:26,456 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 258 treesize of output 210 [2024-11-14 03:00:26,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:26,471 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 202 treesize of output 146 [2024-11-14 03:00:26,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:26,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 6929 treesize of output 6497 [2024-11-14 03:00:27,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:00:27,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:27,159 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 13542 treesize of output 12660 [2024-11-14 03:00:27,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:27,540 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 8098 treesize of output 7406 [2024-11-14 03:00:27,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:00:31,149 INFO L349 Elim1Store]: treesize reduction 642, result has 48.4 percent of original size [2024-11-14 03:00:31,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 4566 treesize of output 4750 [2024-11-14 03:00:32,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:32,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6