./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0235-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0235-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e8dd9d71aae7a8c83467a9093ad4bffb4ddd59cddc2d90362f34ff651f24f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:49:33,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:49:33,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:49:33,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:49:33,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:49:33,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:49:33,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:49:33,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:49:33,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:49:33,461 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:49:33,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:49:33,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:49:33,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:49:33,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:49:33,461 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:49:33,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:49:33,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:49:33,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:33,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:49:33,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:49:33,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:49:33,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:49:33,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:49:33,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:49:33,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 6e8dd9d71aae7a8c83467a9093ad4bffb4ddd59cddc2d90362f34ff651f24f9a [2025-03-08 22:49:33,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:49:33,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:49:33,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:49:33,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:49:33,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:49:33,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0235-1.i [2025-03-08 22:49:34,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b14053c/764fab77b0484a9684564fe4151034b4/FLAG95b5b5082 [2025-03-08 22:49:35,035 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:49:35,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0235-1.i [2025-03-08 22:49:35,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b14053c/764fab77b0484a9684564fe4151034b4/FLAG95b5b5082 [2025-03-08 22:49:35,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b14053c/764fab77b0484a9684564fe4151034b4 [2025-03-08 22:49:35,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:49:35,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:49:35,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:35,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:49:35,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:49:35,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299f315c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35, skipping insertion in model container [2025-03-08 22:49:35,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:49:35,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:35,648 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:49:35,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:35,704 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:49:35,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35 WrapperNode [2025-03-08 22:49:35,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:35,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:35,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:49:35,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:49:35,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,748 INFO L138 Inliner]: procedures = 188, calls = 69, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 230 [2025-03-08 22:49:35,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:35,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:49:35,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:49:35,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:49:35,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,778 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 9, 26]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 1, 12]. [2025-03-08 22:49:35,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:49:35,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:49:35,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:49:35,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:49:35,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (1/1) ... [2025-03-08 22:49:35,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:35,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:49:35,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:49:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:49:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:49:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:49:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-03-08 22:49:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:49:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-03-08 22:49:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-03-08 22:49:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:49:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:49:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:49:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:49:35,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:49:35,944 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:49:35,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:49:36,168 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; [2025-03-08 22:49:36,297 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L786: havoc main_#t~mem37#1.base, main_#t~mem37#1.offset; [2025-03-08 22:49:36,328 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-03-08 22:49:36,328 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:49:36,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:49:36,342 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:49:36,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:36 BoogieIcfgContainer [2025-03-08 22:49:36,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:49:36,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:49:36,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:49:36,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:49:36,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:49:35" (1/3) ... [2025-03-08 22:49:36,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed8b5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:36, skipping insertion in model container [2025-03-08 22:49:36,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:35" (2/3) ... [2025-03-08 22:49:36,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed8b5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:36, skipping insertion in model container [2025-03-08 22:49:36,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:36" (3/3) ... [2025-03-08 22:49:36,352 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-1.i [2025-03-08 22:49:36,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:49:36,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-1.i that has 3 procedures, 228 locations, 1 initial locations, 11 loop locations, and 85 error locations. [2025-03-08 22:49:36,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:49:36,396 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=PETRI_NET, 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;@27fdf8f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:49:36,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2025-03-08 22:49:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 129 states have (on average 1.9069767441860466) internal successors, (246), 214 states have internal predecessors, (246), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:49:36,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:36,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:49:36,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:36,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash 8957029, now seen corresponding path program 1 times [2025-03-08 22:49:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828979951] [2025-03-08 22:49:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:49:36,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:49:36,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:36,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:36,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828979951] [2025-03-08 22:49:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828979951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:36,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:36,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:36,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97661875] [2025-03-08 22:49:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:36,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:49:36,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:36,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:49:36,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:49:36,509 INFO L87 Difference]: Start difference. First operand has 228 states, 129 states have (on average 1.9069767441860466) internal successors, (246), 214 states have internal predecessors, (246), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:36,527 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2025-03-08 22:49:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:49:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:49:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:36,532 INFO L225 Difference]: With dead ends: 228 [2025-03-08 22:49:36,532 INFO L226 Difference]: Without dead ends: 226 [2025-03-08 22:49:36,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:49:36,535 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:36,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:49:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-08 22:49:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-08 22:49:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 128 states have (on average 1.8203125) internal successors, (233), 212 states have internal predecessors, (233), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2025-03-08 22:49:36,565 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 4 [2025-03-08 22:49:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:36,565 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2025-03-08 22:49:36,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2025-03-08 22:49:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:36,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:36,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:36,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:49:36,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 17855320, now seen corresponding path program 1 times [2025-03-08 22:49:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870253166] [2025-03-08 22:49:36,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:36,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:36,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:36,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:36,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870253166] [2025-03-08 22:49:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870253166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:36,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530588858] [2025-03-08 22:49:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:36,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:36,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:36,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:36,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:36,665 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-08 22:49:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:36,787 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2025-03-08 22:49:36,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:36,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-03-08 22:49:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:36,789 INFO L225 Difference]: With dead ends: 225 [2025-03-08 22:49:36,789 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 22:49:36,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:36,789 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:36,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 417 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 22:49:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-08 22:49:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 128 states have (on average 1.8125) internal successors, (232), 211 states have internal predecessors, (232), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 254 transitions. [2025-03-08 22:49:36,800 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 254 transitions. Word has length 6 [2025-03-08 22:49:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:36,801 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 254 transitions. [2025-03-08 22:49:36,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-08 22:49:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2025-03-08 22:49:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:49:36,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:36,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:36,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:49:36,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:36,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash 553515021, now seen corresponding path program 1 times [2025-03-08 22:49:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:36,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466945008] [2025-03-08 22:49:36,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:36,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:36,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:49:36,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:49:36,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:36,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:36,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939375787] [2025-03-08 22:49:36,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:36,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:36,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:36,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:49:36,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:49:36,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:49:36,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:36,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:36,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:49:36,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:36,970 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 [2025-03-08 22:49:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:36,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:49:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466945008] [2025-03-08 22:49:36,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:36,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939375787] [2025-03-08 22:49:36,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939375787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:36,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:36,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:49:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387905974] [2025-03-08 22:49:36,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:36,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:49:36,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:36,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:49:36,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:49:36,986 INFO L87 Difference]: Start difference. First operand 225 states and 254 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-08 22:49:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:37,119 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2025-03-08 22:49:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:49:37,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-08 22:49:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:37,121 INFO L225 Difference]: With dead ends: 234 [2025-03-08 22:49:37,121 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 22:49:37,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:49:37,121 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 11 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 663 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:37,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 663 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 22:49:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-08 22:49:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 136 states have (on average 1.7720588235294117) internal successors, (241), 219 states have internal predecessors, (241), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 263 transitions. [2025-03-08 22:49:37,137 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 263 transitions. Word has length 7 [2025-03-08 22:49:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:37,137 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 263 transitions. [2025-03-08 22:49:37,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-08 22:49:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 263 transitions. [2025-03-08 22:49:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 22:49:37,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:37,139 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:37,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:49:37,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:37,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:37,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 196707822, now seen corresponding path program 1 times [2025-03-08 22:49:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476767878] [2025-03-08 22:49:37,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:37,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:49:37,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:49:37,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:37,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498528868] [2025-03-08 22:49:37,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:37,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:37,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:37,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:37,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:49:37,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:49:37,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:49:37,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:37,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:37,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:49:37,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:37,620 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 7 [2025-03-08 22:49:37,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:49:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 22:49:37,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:49:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476767878] [2025-03-08 22:49:37,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498528868] [2025-03-08 22:49:37,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498528868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:37,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:37,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:49:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026833232] [2025-03-08 22:49:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:37,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:49:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:37,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:49:37,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:49:37,726 INFO L87 Difference]: Start difference. First operand 234 states and 263 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 22:49:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:37,860 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2025-03-08 22:49:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:49:37,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-03-08 22:49:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:37,862 INFO L225 Difference]: With dead ends: 246 [2025-03-08 22:49:37,862 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 22:49:37,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:49:37,864 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:37,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 908 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 22:49:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-08 22:49:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 221 states have internal predecessors, (243), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 265 transitions. [2025-03-08 22:49:37,876 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 265 transitions. Word has length 66 [2025-03-08 22:49:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 265 transitions. [2025-03-08 22:49:37,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 22:49:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2025-03-08 22:49:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 22:49:37,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:37,877 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:37,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:49:38,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 22:49:38,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2074062647, now seen corresponding path program 1 times [2025-03-08 22:49:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491956901] [2025-03-08 22:49:38,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:38,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:49:38,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:49:38,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:38,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315211582] [2025-03-08 22:49:38,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:38,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:38,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:38,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:49:38,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:49:38,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:49:38,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:38,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:38,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:49:38,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:38,518 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 7 [2025-03-08 22:49:38,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 13 treesize of output 9 [2025-03-08 22:49:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 22:49:38,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:49:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491956901] [2025-03-08 22:49:38,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315211582] [2025-03-08 22:49:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315211582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:38,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-08 22:49:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697881032] [2025-03-08 22:49:38,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:38,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:49:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:38,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:49:38,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:49:38,773 INFO L87 Difference]: Start difference. First operand 236 states and 265 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 22:49:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:39,048 INFO L93 Difference]: Finished difference Result 255 states and 285 transitions. [2025-03-08 22:49:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:49:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2025-03-08 22:49:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:39,049 INFO L225 Difference]: With dead ends: 255 [2025-03-08 22:49:39,049 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 22:49:39,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:49:39,050 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 20 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:39,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1397 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 22:49:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-08 22:49:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 142 states have (on average 1.7394366197183098) internal successors, (247), 225 states have internal predecessors, (247), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 269 transitions. [2025-03-08 22:49:39,056 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 269 transitions. Word has length 71 [2025-03-08 22:49:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:39,057 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 269 transitions. [2025-03-08 22:49:39,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 22:49:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 269 transitions. [2025-03-08 22:49:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 22:49:39,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:39,058 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:39,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:49:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:39,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1005850706, now seen corresponding path program 2 times [2025-03-08 22:49:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115745497] [2025-03-08 22:49:39,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:49:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:39,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 22:49:39,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:49:39,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:49:39,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882898240] [2025-03-08 22:49:39,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:49:39,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:39,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:39,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:39,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:49:39,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 22:49:39,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:49:39,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:49:39,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:39,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:49:39,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:39,766 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 [2025-03-08 22:49:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-08 22:49:39,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:49:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115745497] [2025-03-08 22:49:39,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882898240] [2025-03-08 22:49:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882898240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:39,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:49:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257414826] [2025-03-08 22:49:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:39,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:49:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:39,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:49:39,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:49:39,781 INFO L87 Difference]: Start difference. First operand 240 states and 269 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 22:49:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:39,874 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2025-03-08 22:49:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:49:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-03-08 22:49:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:39,876 INFO L225 Difference]: With dead ends: 239 [2025-03-08 22:49:39,876 INFO L226 Difference]: Without dead ends: 239 [2025-03-08 22:49:39,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:49:39,877 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 11 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:39,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 685 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-08 22:49:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-08 22:49:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 142 states have (on average 1.732394366197183) internal successors, (246), 224 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 268 transitions. [2025-03-08 22:49:39,882 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 268 transitions. Word has length 86 [2025-03-08 22:49:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:39,882 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 268 transitions. [2025-03-08 22:49:39,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 22:49:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 268 transitions. [2025-03-08 22:49:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 22:49:39,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:39,883 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:39,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:49:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:40,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:40,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 200762683, now seen corresponding path program 1 times [2025-03-08 22:49:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:40,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600472651] [2025-03-08 22:49:40,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:40,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 22:49:40,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:49:40,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:40,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-08 22:49:40,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:40,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600472651] [2025-03-08 22:49:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600472651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561027225] [2025-03-08 22:49:40,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:40,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:40,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:40,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:40,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:49:40,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 22:49:40,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:49:40,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:40,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:40,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:49:40,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:41,056 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-08 22:49:41,094 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:49:41,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 22:49:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 1 refuted. 0 times theorem prover too weak. 255 trivial. 21 not checked. [2025-03-08 22:49:41,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:41,271 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:49:41,272 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 12 treesize of output 11 [2025-03-08 22:49:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-08 22:49:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561027225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:41,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:49:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-03-08 22:49:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546875826] [2025-03-08 22:49:41,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:41,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:49:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:41,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:49:41,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2025-03-08 22:49:41,292 INFO L87 Difference]: Start difference. First operand 239 states and 268 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 22:49:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:41,782 INFO L93 Difference]: Finished difference Result 338 states and 386 transitions. [2025-03-08 22:49:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:49:41,782 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-03-08 22:49:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:41,784 INFO L225 Difference]: With dead ends: 338 [2025-03-08 22:49:41,784 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 22:49:41,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2025-03-08 22:49:41,785 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 237 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:41,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1671 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 909 Invalid, 0 Unknown, 363 Unchecked, 0.4s Time] [2025-03-08 22:49:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 22:49:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 237. [2025-03-08 22:49:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 142 states have (on average 1.7183098591549295) internal successors, (244), 222 states have internal predecessors, (244), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 266 transitions. [2025-03-08 22:49:41,794 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 266 transitions. Word has length 95 [2025-03-08 22:49:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:41,794 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 266 transitions. [2025-03-08 22:49:41,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 22:49:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 266 transitions. [2025-03-08 22:49:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 22:49:41,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:41,797 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:41,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:49:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:42,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:42,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 200762684, now seen corresponding path program 1 times [2025-03-08 22:49:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:42,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449347128] [2025-03-08 22:49:42,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:42,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 22:49:42,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:49:42,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:42,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666585324] [2025-03-08 22:49:42,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:42,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:42,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:42,151 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:42,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:49:42,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 22:49:42,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:49:42,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:42,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:42,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 22:49:42,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:42,510 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 7 [2025-03-08 22:49:42,538 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 13 treesize of output 9 [2025-03-08 22:49:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 227 proven. 96 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-08 22:49:42,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 128 proven. 32 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 22:49:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449347128] [2025-03-08 22:49:42,930 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666585324] [2025-03-08 22:49:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666585324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:42,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:42,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-08 22:49:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836913995] [2025-03-08 22:49:42,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:42,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:49:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:42,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:49:42,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:49:42,931 INFO L87 Difference]: Start difference. First operand 237 states and 266 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 22:49:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:43,439 INFO L93 Difference]: Finished difference Result 259 states and 292 transitions. [2025-03-08 22:49:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:49:43,440 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-03-08 22:49:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:43,441 INFO L225 Difference]: With dead ends: 259 [2025-03-08 22:49:43,441 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 22:49:43,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:49:43,442 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 21 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2775 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:43,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2775 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:49:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 22:49:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-08 22:49:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 149 states have (on average 1.6845637583892616) internal successors, (251), 229 states have internal predecessors, (251), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:49:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2025-03-08 22:49:43,447 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 95 [2025-03-08 22:49:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2025-03-08 22:49:43,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 22:49:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2025-03-08 22:49:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 22:49:43,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:43,448 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:43,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:49:43,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:43,649 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:49:43,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash 36350197, now seen corresponding path program 2 times [2025-03-08 22:49:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961538919] [2025-03-08 22:49:43,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:49:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:43,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-08 22:49:43,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:49:43,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:49:43,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 97 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-03-08 22:49:45,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:45,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961538919] [2025-03-08 22:49:45,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961538919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:45,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147974295] [2025-03-08 22:49:45,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:49:45,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:45,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:45,466 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:45,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:49:45,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-08 22:49:46,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:49:46,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:49:46,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:46,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-08 22:49:46,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:46,322 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 10 treesize of output 9 [2025-03-08 22:49:47,982 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-08 22:49:48,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:49:48,036 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 18 treesize of output 13 [2025-03-08 22:49:48,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:49:48,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:49:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 503 proven. 316 refuted. 0 times theorem prover too weak. 473 trivial. 103 not checked. [2025-03-08 22:49:48,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147974295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:48,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2025-03-08 22:49:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111909915] [2025-03-08 22:49:48,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:48,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 22:49:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:48,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 22:49:48,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2014, Unknown=1, NotChecked=90, Total=2256 [2025-03-08 22:49:48,351 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 22:49:52,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:49:56,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:00,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:04,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:09,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:13,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:17,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:21,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:26,697 INFO L93 Difference]: Finished difference Result 351 states and 402 transitions. [2025-03-08 22:50:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 22:50:26,698 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 118 [2025-03-08 22:50:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:26,699 INFO L225 Difference]: With dead ends: 351 [2025-03-08 22:50:26,699 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 22:50:26,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=296, Invalid=3489, Unknown=1, NotChecked=120, Total=3906 [2025-03-08 22:50:26,702 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 365 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 5938 mSolverCounterSat, 24 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 6331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5938 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:26,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1960 Invalid, 6331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5938 Invalid, 8 Unknown, 361 Unchecked, 37.2s Time] [2025-03-08 22:50:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 22:50:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 242. [2025-03-08 22:50:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 149 states have (on average 1.6711409395973154) internal successors, (249), 227 states have internal predecessors, (249), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:50:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2025-03-08 22:50:26,710 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 118 [2025-03-08 22:50:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:26,711 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2025-03-08 22:50:26,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 22:50:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2025-03-08 22:50:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 22:50:26,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:26,712 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:26,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 22:50:26,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:26,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:50:26,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash 572806545, now seen corresponding path program 1 times [2025-03-08 22:50:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261686234] [2025-03-08 22:50:26,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:26,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:26,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:26,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:26,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 833 proven. 96 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-08 22:50:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261686234] [2025-03-08 22:50:27,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261686234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065278326] [2025-03-08 22:50:27,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:27,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:27,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:50:28,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:28,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:28,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:28,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:28,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 22:50:28,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:28,309 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-08 22:50:28,396 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:50:28,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 22:50:28,431 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-08 22:50:28,468 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:50:28,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 22:50:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 1 refuted. 0 times theorem prover too weak. 466 trivial. 209 not checked. [2025-03-08 22:50:28,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065278326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:28,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:50:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 22 [2025-03-08 22:50:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454113893] [2025-03-08 22:50:28,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:28,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:50:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:28,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:50:28,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=487, Unknown=2, NotChecked=90, Total=650 [2025-03-08 22:50:28,747 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 22:50:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:29,840 INFO L93 Difference]: Finished difference Result 340 states and 388 transitions. [2025-03-08 22:50:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:50:29,840 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 120 [2025-03-08 22:50:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:29,842 INFO L225 Difference]: With dead ends: 340 [2025-03-08 22:50:29,842 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 22:50:29,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=708, Unknown=2, NotChecked=110, Total=930 [2025-03-08 22:50:29,842 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 693 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:29,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 2351 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1434 Invalid, 0 Unknown, 715 Unchecked, 0.9s Time] [2025-03-08 22:50:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 22:50:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 239. [2025-03-08 22:50:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 149 states have (on average 1.651006711409396) internal successors, (246), 224 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:50:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 268 transitions. [2025-03-08 22:50:29,850 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 268 transitions. Word has length 120 [2025-03-08 22:50:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:29,851 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 268 transitions. [2025-03-08 22:50:29,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 22:50:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 268 transitions. [2025-03-08 22:50:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 22:50:29,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:29,852 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:29,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:50:30,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 22:50:30,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:50:30,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 572806546, now seen corresponding path program 1 times [2025-03-08 22:50:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:30,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140255260] [2025-03-08 22:50:30,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:30,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:30,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:30,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:30,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:30,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 246 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-03-08 22:50:31,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140255260] [2025-03-08 22:50:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140255260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386384941] [2025-03-08 22:50:31,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:31,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:31,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:31,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:31,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:50:31,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:32,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:32,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:32,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:32,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-03-08 22:50:32,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:32,600 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 10 treesize of output 9 [2025-03-08 22:50:34,211 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-08 22:50:34,304 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:50:34,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 22:50:34,310 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 [2025-03-08 22:50:34,407 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-08 22:50:34,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:34,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:50:34,483 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 22:50:34,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 22:50:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 444 proven. 365 refuted. 0 times theorem prover too weak. 152 trivial. 434 not checked. [2025-03-08 22:50:34,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386384941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:34,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:50:34,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 33] total 54 [2025-03-08 22:50:34,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295454158] [2025-03-08 22:50:34,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:34,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 22:50:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:34,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 22:50:34,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2778, Unknown=2, NotChecked=214, Total=3192 [2025-03-08 22:50:34,731 INFO L87 Difference]: Start difference. First operand 239 states and 268 transitions. Second operand has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 22:50:38,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:48,454 INFO L93 Difference]: Finished difference Result 378 states and 441 transitions. [2025-03-08 22:50:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 22:50:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 120 [2025-03-08 22:50:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:48,456 INFO L225 Difference]: With dead ends: 378 [2025-03-08 22:50:48,456 INFO L226 Difference]: Without dead ends: 378 [2025-03-08 22:50:48,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=479, Invalid=5688, Unknown=3, NotChecked=310, Total=6480 [2025-03-08 22:50:48,458 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 437 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 5453 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 6269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5453 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 777 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:48,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1702 Invalid, 6269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 5453 Invalid, 1 Unknown, 777 Unchecked, 7.2s Time] [2025-03-08 22:50:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-08 22:50:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 236. [2025-03-08 22:50:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 149 states have (on average 1.6308724832214765) internal successors, (243), 221 states have internal predecessors, (243), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 22:50:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 265 transitions. [2025-03-08 22:50:48,468 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 265 transitions. Word has length 120 [2025-03-08 22:50:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:48,469 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 265 transitions. [2025-03-08 22:50:48,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 22:50:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2025-03-08 22:50:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 22:50:48,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:48,470 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:48,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:50:48,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:48,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:50:48,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1106359573, now seen corresponding path program 1 times [2025-03-08 22:50:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:48,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243364504] [2025-03-08 22:50:48,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:48,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:48,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:50:48,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:50:48,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:48,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 773 proven. 245 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 22:50:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243364504] [2025-03-08 22:50:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243364504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172761559] [2025-03-08 22:50:49,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:49,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:49,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:49,893 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:49,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:50:50,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:50:50,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:50:50,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:50,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:50,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 22:50:50,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:50,392 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-08 22:50:50,393 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-08 22:50:50,404 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-08 22:50:50,406 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-08 22:50:50,416 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-08 22:50:50,421 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-08 22:50:50,531 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-08 22:50:50,535 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-08 22:50:50,581 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-08 22:50:50,585 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-08 22:50:50,622 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-08 22:50:50,665 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:50:50,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 22:50:50,749 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from false [2025-03-08 22:50:50,756 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from true [2025-03-08 22:50:50,867 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from false [2025-03-08 22:50:50,871 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from true [2025-03-08 22:50:51,065 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|))))))) is different from false [2025-03-08 22:50:51,071 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|))))))) is different from true [2025-03-08 22:50:51,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse2))) is different from false [2025-03-08 22:50:51,264 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse2))) is different from true [2025-03-08 22:50:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 660 proven. 262 refuted. 0 times theorem prover too weak. 293 trivial. 180 not checked. [2025-03-08 22:50:51,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172761559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:51,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:50:51,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 34 [2025-03-08 22:50:51,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796341666] [2025-03-08 22:50:51,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:51,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 22:50:51,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:51,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 22:50:51,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=673, Unknown=19, NotChecked=610, Total=1406 [2025-03-08 22:50:51,469 INFO L87 Difference]: Start difference. First operand 236 states and 265 transitions. Second operand has 35 states, 32 states have (on average 2.78125) internal successors, (89), 28 states have internal predecessors, (89), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 22:50:51,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from false [2025-03-08 22:50:51,753 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from true [2025-03-08 22:50:51,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from false [2025-03-08 22:50:51,757 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from true [2025-03-08 22:50:51,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) .cse0))) is different from false [2025-03-08 22:50:51,763 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) .cse0))) is different from true [2025-03-08 22:50:51,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-08 22:50:51,785 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-08 22:50:51,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-08 22:50:51,806 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-08 22:50:51,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-08 22:50:51,890 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-08 22:50:51,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-08 22:50:51,931 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-08 22:50:51,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|)))))) .cse3)) is different from false [2025-03-08 22:50:51,951 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|)))))) .cse3)) is different from true [2025-03-08 22:50:52,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse5) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse2))) .cse3)) is different from false [2025-03-08 22:50:52,017 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse5) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse2))) .cse3)) is different from true [2025-03-08 22:50:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:52,903 INFO L93 Difference]: Finished difference Result 356 states and 410 transitions. [2025-03-08 22:50:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:50:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.78125) internal successors, (89), 28 states have internal predecessors, (89), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 126 [2025-03-08 22:50:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:52,905 INFO L225 Difference]: With dead ends: 356 [2025-03-08 22:50:52,905 INFO L226 Difference]: Without dead ends: 356 [2025-03-08 22:50:52,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=936, Unknown=37, NotChecked=1520, Total=2652 [2025-03-08 22:50:52,906 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 232 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 6158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4275 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:52,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 2960 Invalid, 6158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1850 Invalid, 0 Unknown, 4275 Unchecked, 1.0s Time] [2025-03-08 22:50:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-08 22:50:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 255. [2025-03-08 22:50:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 165 states have (on average 1.587878787878788) internal successors, (262), 237 states have internal predecessors, (262), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 22:50:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 290 transitions. [2025-03-08 22:50:52,914 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 290 transitions. Word has length 126 [2025-03-08 22:50:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 290 transitions. [2025-03-08 22:50:52,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.78125) internal successors, (89), 28 states have internal predecessors, (89), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 22:50:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 290 transitions. [2025-03-08 22:50:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 22:50:52,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:52,915 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:52,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 22:50:53,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 22:50:53,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-08 22:50:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1106359572, now seen corresponding path program 1 times [2025-03-08 22:50:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696074385] [2025-03-08 22:50:53,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:53,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:50:53,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:50:53,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:53,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 659 proven. 483 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-08 22:50:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696074385] [2025-03-08 22:50:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696074385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775440170] [2025-03-08 22:50:55,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:55,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:55,811 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:55,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:50:56,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:50:57,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:50:57,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:57,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:57,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 144 conjuncts are in the unsatisfiable core [2025-03-08 22:50:57,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:57,528 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 10 treesize of output 9 [2025-03-08 22:50:59,976 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:59,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:51:00,015 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:51:00,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 22:51:00,341 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-08 22:51:00,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-08 22:51:00,352 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 [2025-03-08 22:51:00,581 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-08 22:51:00,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:00,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:51:00,649 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-08 22:51:00,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-03-08 22:51:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 403 proven. 528 refuted. 0 times theorem prover too weak. 233 trivial. 231 not checked. [2025-03-08 22:51:00,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:00,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775440170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:00,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:51:00,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 41] total 70 [2025-03-08 22:51:00,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981497208] [2025-03-08 22:51:00,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:00,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-08 22:51:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:00,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-08 22:51:00,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=4819, Unknown=1, NotChecked=140, Total=5256 [2025-03-08 22:51:00,985 INFO L87 Difference]: Start difference. First operand 255 states and 290 transitions. Second operand has 71 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 64 states have internal predecessors, (130), 6 states have call successors, (9), 2 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 22:51:05,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]