./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0234-2.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-0234-2.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 3248e88e6fd49fdcf0a9f78f1aa9e69276951d353f75f39f6bb30d51b2e53989 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:49:15,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:49:15,945 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:15,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:49:15,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:49:15,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:49:15,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:49:15,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:49:15,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:49:15,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:49:15,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:49:15,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:49:15,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:49:15,975 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:49:15,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:15,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:49:15,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:49:15,976 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 -> 3248e88e6fd49fdcf0a9f78f1aa9e69276951d353f75f39f6bb30d51b2e53989 [2025-03-08 22:49:16,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:49:16,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:49:16,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:49:16,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:49:16,237 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:49:16,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0234-2.i [2025-03-08 22:49:17,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2028400/e601fe995f884debaad767f4b75a059f/FLAG56bf0fe6f [2025-03-08 22:49:17,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:49:17,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0234-2.i [2025-03-08 22:49:17,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2028400/e601fe995f884debaad767f4b75a059f/FLAG56bf0fe6f [2025-03-08 22:49:17,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2028400/e601fe995f884debaad767f4b75a059f [2025-03-08 22:49:17,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:49:17,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:49:17,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:17,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:49:17,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:49:17,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:17" (1/1) ... [2025-03-08 22:49:17,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435ded65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:17, skipping insertion in model container [2025-03-08 22:49:17,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:17" (1/1) ... [2025-03-08 22:49:17,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:49:18,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:18,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:49:18,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:18,094 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:49:18,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:18 WrapperNode [2025-03-08 22:49:18,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:18,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:18,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:49:18,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:49:18,100 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:18" (1/1) ... [2025-03-08 22:49:18,117 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:18" (1/1) ... [2025-03-08 22:49:18,138 INFO L138 Inliner]: procedures = 188, calls = 58, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 197 [2025-03-08 22:49:18,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:18,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:49:18,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:49:18,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:49:18,145 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:18" (1/1) ... [2025-03-08 22:49:18,145 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:18" (1/1) ... [2025-03-08 22:49:18,148 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:18" (1/1) ... [2025-03-08 22:49:18,176 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 4, 25]. 81 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:18,176 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:18" (1/1) ... [2025-03-08 22:49:18,176 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:18" (1/1) ... [2025-03-08 22:49:18,183 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:18" (1/1) ... [2025-03-08 22:49:18,184 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:18" (1/1) ... [2025-03-08 22:49:18,185 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:18" (1/1) ... [2025-03-08 22:49:18,186 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:18" (1/1) ... [2025-03-08 22:49:18,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:49:18,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:49:18,191 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:49:18,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:49:18,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:18" (1/1) ... [2025-03-08 22:49:18,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:18,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:18,216 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:18,223 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:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-03-08 22:49:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:49:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:49:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:49:18,336 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:49:18,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:49:18,441 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:18,794 INFO L? ?]: Removed 190 outVars from TransFormulas that were not future-live. [2025-03-08 22:49:18,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:49:18,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:49:18,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:49:18,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:18 BoogieIcfgContainer [2025-03-08 22:49:18,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:49:18,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:49:18,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:49:18,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:49:18,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:49:17" (1/3) ... [2025-03-08 22:49:18,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2778197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:18, skipping insertion in model container [2025-03-08 22:49:18,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:18" (2/3) ... [2025-03-08 22:49:18,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2778197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:18, skipping insertion in model container [2025-03-08 22:49:18,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:18" (3/3) ... [2025-03-08 22:49:18,812 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0234-2.i [2025-03-08 22:49:18,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:49:18,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0234-2.i that has 2 procedures, 177 locations, 1 initial locations, 11 loop locations, and 70 error locations. [2025-03-08 22:49:18,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:49:18,872 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;@1b7ebbf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:49:18,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-08 22:49:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 169 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:49:18,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:18,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:49:18,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:18,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 7048421, now seen corresponding path program 1 times [2025-03-08 22:49:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425281928] [2025-03-08 22:49:18,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:18,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:18,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:49:18,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:49:18,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:18,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:19,002 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:19,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:19,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425281928] [2025-03-08 22:49:19,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425281928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:19,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866205148] [2025-03-08 22:49:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:19,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:49:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:19,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:49:19,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:49:19,029 INFO L87 Difference]: Start difference. First operand has 177 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 169 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 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:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:19,047 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2025-03-08 22:49:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:49:19,048 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:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:19,053 INFO L225 Difference]: With dead ends: 177 [2025-03-08 22:49:19,053 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 22:49:19,054 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:19,056 INFO L435 NwaCegarLoop]: 192 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, 192 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:19,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 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:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 22:49:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-08 22:49:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 98 states have (on average 1.816326530612245) internal successors, (178), 167 states have internal predecessors, (178), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2025-03-08 22:49:19,092 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 4 [2025-03-08 22:49:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:19,092 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2025-03-08 22:49:19,092 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:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2025-03-08 22:49:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:19,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:19,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:19,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:49:19,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1816330450, now seen corresponding path program 1 times [2025-03-08 22:49:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:19,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099531217] [2025-03-08 22:49:19,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:19,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:19,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:19,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:19,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:19,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:19,209 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:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099531217] [2025-03-08 22:49:19,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099531217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:19,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:19,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644799755] [2025-03-08 22:49:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:19,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:19,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:19,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:19,210 INFO L87 Difference]: Start difference. First operand 175 states and 190 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:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:19,322 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2025-03-08 22:49:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:19,322 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:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:19,323 INFO L225 Difference]: With dead ends: 174 [2025-03-08 22:49:19,323 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 22:49:19,323 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:19,324 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:19,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 301 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 22:49:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-08 22:49:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 98 states have (on average 1.8061224489795917) internal successors, (177), 166 states have internal predecessors, (177), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2025-03-08 22:49:19,331 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 6 [2025-03-08 22:49:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:19,331 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2025-03-08 22:49:19,331 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:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2025-03-08 22:49:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:49:19,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:19,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:19,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:49:19,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:19,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -471669122, now seen corresponding path program 1 times [2025-03-08 22:49:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:19,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707198208] [2025-03-08 22:49:19,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:19,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:49:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:49:19,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:19,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417949537] [2025-03-08 22:49:19,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:19,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:19,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:19,352 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:19,354 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:19,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:49:19,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:49:19,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:19,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:19,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:49:19,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:19,491 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:19,513 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:19,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:49:19,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:19,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707198208] [2025-03-08 22:49:19,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:19,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417949537] [2025-03-08 22:49:19,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417949537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:49:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007670671] [2025-03-08 22:49:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:19,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:49:19,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:19,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:49:19,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:49:19,517 INFO L87 Difference]: Start difference. First operand 174 states and 189 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:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:19,658 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2025-03-08 22:49:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:49:19,658 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:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:19,661 INFO L225 Difference]: With dead ends: 183 [2025-03-08 22:49:19,661 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 22:49:19,661 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:19,662 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:19,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 480 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 22:49:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-08 22:49:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 106 states have (on average 1.7547169811320755) internal successors, (186), 174 states have internal predecessors, (186), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2025-03-08 22:49:19,672 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 7 [2025-03-08 22:49:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:19,672 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2025-03-08 22:49:19,672 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:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2025-03-08 22:49:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 22:49:19,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:19,673 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:19,680 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:19,878 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:19,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:19,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 998580829, now seen corresponding path program 1 times [2025-03-08 22:49:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:19,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815111123] [2025-03-08 22:49:19,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:19,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:19,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:49:19,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:49:19,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:19,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:19,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268901629] [2025-03-08 22:49:19,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:19,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:19,965 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:19,970 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:20,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:49:20,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:49:20,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:20,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:20,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 22:49:20,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:20,213 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:20,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:49:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815111123] [2025-03-08 22:49:20,213 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268901629] [2025-03-08 22:49:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268901629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:49:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942060675] [2025-03-08 22:49:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:20,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:49:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:20,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:49:20,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:49:20,215 INFO L87 Difference]: Start difference. First operand 183 states and 198 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:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:20,252 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2025-03-08 22:49:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:49:20,253 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:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:20,254 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:49:20,254 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 22:49:20,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:49:20,255 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:20,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 540 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:49:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 22:49:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-08 22:49:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 176 states have internal predecessors, (188), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2025-03-08 22:49:20,263 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 66 [2025-03-08 22:49:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2025-03-08 22:49:20,263 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:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2025-03-08 22:49:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 22:49:20,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:20,264 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:20,276 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:20,469 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:20,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:20,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2117453165, now seen corresponding path program 1 times [2025-03-08 22:49:20,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:20,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904118627] [2025-03-08 22:49:20,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:20,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:20,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:49:20,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:49:20,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:20,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273248813] [2025-03-08 22:49:20,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:20,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:20,681 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:20,684 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:20,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:49:20,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:49:20,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:20,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:20,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 22:49:20,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:20,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:49:20,993 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:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 102 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 22:49:21,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:49:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904118627] [2025-03-08 22:49:21,260 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273248813] [2025-03-08 22:49:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273248813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:21,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-08 22:49:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175588686] [2025-03-08 22:49:21,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:49:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:21,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:49:21,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:49:21,261 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 22:49:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:21,578 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2025-03-08 22:49:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:49:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-08 22:49:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:21,580 INFO L225 Difference]: With dead ends: 204 [2025-03-08 22:49:21,580 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 22:49:21,580 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:21,581 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 18 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:21,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 966 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:49:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 22:49:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-08 22:49:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 112 states have (on average 1.7142857142857142) internal successors, (192), 180 states have internal predecessors, (192), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 204 transitions. [2025-03-08 22:49:21,592 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 204 transitions. Word has length 71 [2025-03-08 22:49:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:21,592 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 204 transitions. [2025-03-08 22:49:21,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 22:49:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2025-03-08 22:49:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 22:49:21,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:21,596 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:21,603 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:21,796 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:21,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:21,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 51262941, now seen corresponding path program 2 times [2025-03-08 22:49:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477474786] [2025-03-08 22:49:21,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:49:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:21,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 22:49:21,973 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:21,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:49:21,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:21,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522115991] [2025-03-08 22:49:21,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:49:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:21,987 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:21,988 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:22,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 22:49:22,381 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:22,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:49:22,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:22,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 22:49:22,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:22,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:49:22,431 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:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 135 proven. 10 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-08 22:49:22,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 138 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 22:49:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477474786] [2025-03-08 22:49:22,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522115991] [2025-03-08 22:49:22,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522115991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:22,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:22,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-08 22:49:22,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369917118] [2025-03-08 22:49:22,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:22,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:49:22,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:22,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:49:22,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:49:22,818 INFO L87 Difference]: Start difference. First operand 189 states and 204 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 22:49:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:23,339 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2025-03-08 22:49:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:49:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-08 22:49:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:23,340 INFO L225 Difference]: With dead ends: 211 [2025-03-08 22:49:23,340 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 22:49:23,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:49:23,341 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 29 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:23,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1321 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:49:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 22:49:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-08 22:49:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 119 states have (on average 1.6722689075630253) internal successors, (199), 187 states have internal predecessors, (199), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2025-03-08 22:49:23,346 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 86 [2025-03-08 22:49:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:23,346 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2025-03-08 22:49:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 22:49:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2025-03-08 22:49:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 22:49:23,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:23,347 INFO L218 NwaCegarLoop]: trace histogram [40, 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:23,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:49:23,547 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:23,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:23,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 937920861, now seen corresponding path program 3 times [2025-03-08 22:49:23,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:23,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539757851] [2025-03-08 22:49:23,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:49:23,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:23,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-03-08 22:49:23,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 22:49:23,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-03-08 22:49:23,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:23,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983331356] [2025-03-08 22:49:23,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:49:23,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:23,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:23,991 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:23,993 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:24,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-03-08 22:49:24,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 106 statements. [2025-03-08 22:49:24,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:49:24,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:24,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:49:24,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:24,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:49:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2025-03-08 22:49:24,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:49:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539757851] [2025-03-08 22:49:24,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983331356] [2025-03-08 22:49:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983331356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:49:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591259156] [2025-03-08 22:49:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:24,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:49:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:24,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:49:24,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:49:24,196 INFO L87 Difference]: Start difference. First operand 196 states and 211 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:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:24,286 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2025-03-08 22:49:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:49:24,286 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 106 [2025-03-08 22:49:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:24,287 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:49:24,287 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 22:49:24,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:24,288 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:24,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 502 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 22:49:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-08 22:49:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 119 states have (on average 1.6638655462184875) internal successors, (198), 186 states have internal predecessors, (198), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:49:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 210 transitions. [2025-03-08 22:49:24,295 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 210 transitions. Word has length 106 [2025-03-08 22:49:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:24,296 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 210 transitions. [2025-03-08 22:49:24,296 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:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 210 transitions. [2025-03-08 22:49:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 22:49:24,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:24,299 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:24,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:49:24,503 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:24,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:49:24,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1150898738, now seen corresponding path program 1 times [2025-03-08 22:49:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:24,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072626284] [2025-03-08 22:49:24,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:24,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 22:49:24,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:49:24,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:24,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:26,758 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:26,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:26,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072626284] [2025-03-08 22:49:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072626284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:26,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609051414] [2025-03-08 22:49:26,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:26,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:26,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:26,761 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:26,762 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:26,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 22:49:27,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:49:27,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:27,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:27,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-08 22:49:27,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:28,003 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:33,875 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:33,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:49:33,946 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:33,962 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:49:33,963 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:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 419 proven. 526 refuted. 0 times theorem prover too weak. 305 trivial. 145 not checked. [2025-03-08 22:49:34,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:34,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609051414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:34,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:34,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2025-03-08 22:49:34,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496174454] [2025-03-08 22:49:34,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:34,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 22:49:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:34,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 22:49:34,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2013, Unknown=2, NotChecked=90, Total=2256 [2025-03-08 22:49:34,290 INFO L87 Difference]: Start difference. First operand 195 states and 210 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:38,378 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:42,651 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:49:46,806 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:49:50,917 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:55,070 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:49:59,201 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:03,319 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:07,498 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:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:10,364 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2025-03-08 22:50:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:50:10,364 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:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:10,366 INFO L225 Difference]: With dead ends: 200 [2025-03-08 22:50:10,366 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 22:50:10,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=296, Invalid=3488, Unknown=2, NotChecked=120, Total=3906 [2025-03-08 22:50:10,368 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 33 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:10,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2981 Invalid, 2470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2275 Invalid, 8 Unknown, 177 Unchecked, 34.8s Time] [2025-03-08 22:50:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 22:50:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2025-03-08 22:50:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 119 states have (on average 1.638655462184874) internal successors, (195), 183 states have internal predecessors, (195), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:50:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2025-03-08 22:50:10,372 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 118 [2025-03-08 22:50:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2025-03-08 22:50:10,373 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:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2025-03-08 22:50:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 22:50:10,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:10,374 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:50:10,396 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:50:10,574 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:50:10,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:50:10,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1150898739, now seen corresponding path program 1 times [2025-03-08 22:50:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:10,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761972460] [2025-03-08 22:50:10,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:10,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 22:50:10,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:50:10,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:10,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 61 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-03-08 22:50:11,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761972460] [2025-03-08 22:50:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761972460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034636232] [2025-03-08 22:50:11,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:11,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:11,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:11,265 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:50:11,267 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:50:11,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 22:50:11,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:50:11,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:11,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:50:11,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:11,640 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:11,681 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:50:11,682 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:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 1 refuted. 0 times theorem prover too weak. 733 trivial. 60 not checked. [2025-03-08 22:50:11,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:11,969 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:50:11,969 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:50:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 61 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-03-08 22:50:11,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034636232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:11,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:11,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 16 [2025-03-08 22:50:11,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455323586] [2025-03-08 22:50:11,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:11,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:50:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:11,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:50:12,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2025-03-08 22:50:12,000 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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:50:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:12,505 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2025-03-08 22:50:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:50:12,505 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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 118 [2025-03-08 22:50:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:12,506 INFO L225 Difference]: With dead ends: 191 [2025-03-08 22:50:12,506 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 22:50:12,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=310, Unknown=1, NotChecked=36, Total=420 [2025-03-08 22:50:12,507 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 13 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:12,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1163 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 630 Invalid, 0 Unknown, 176 Unchecked, 0.4s Time] [2025-03-08 22:50:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 22:50:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-08 22:50:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 119 states have (on average 1.6302521008403361) internal successors, (194), 182 states have internal predecessors, (194), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:50:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2025-03-08 22:50:12,510 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 118 [2025-03-08 22:50:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:12,511 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2025-03-08 22:50:12,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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:50:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2025-03-08 22:50:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 22:50:12,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:12,512 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:12,520 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:12,712 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:12,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:50:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2087878762, now seen corresponding path program 1 times [2025-03-08 22:50:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675454478] [2025-03-08 22:50:12,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:12,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:12,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:12,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:12,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 776 proven. 153 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-08 22:50:13,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:13,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675454478] [2025-03-08 22:50:13,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675454478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:13,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823051817] [2025-03-08 22:50:13,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:13,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:13,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:13,820 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:13,823 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:14,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:14,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:14,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:14,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:14,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 22:50:14,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:14,272 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from false [2025-03-08 22:50:14,274 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from true [2025-03-08 22:50:14,290 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-03-08 22:50:14,293 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-03-08 22:50:14,327 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:14,379 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:50:14,379 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:14,398 WARN L851 $PredicateComparison]: unable to prove that (or (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_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0))))))) is different from false [2025-03-08 22:50:14,400 WARN L873 $PredicateComparison]: unable to prove that (or (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_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0))))))) is different from true [2025-03-08 22:50:14,427 WARN L851 $PredicateComparison]: unable to prove that (or (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)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) is different from false [2025-03-08 22:50:14,430 WARN L873 $PredicateComparison]: unable to prove that (or (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)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) is different from true [2025-03-08 22:50:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 90 refuted. 0 times theorem prover too weak. 466 trivial. 120 not checked. [2025-03-08 22:50:14,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:15,146 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:50:15,146 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:50:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 210 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-08 22:50:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823051817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:15,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:15,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 33 [2025-03-08 22:50:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523479190] [2025-03-08 22:50:15,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:15,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:50:15,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:15,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:50:15,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=710, Unknown=9, NotChecked=290, Total=1122 [2025-03-08 22:50:15,166 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand has 34 states, 32 states have (on average 2.75) internal successors, (88), 27 states have internal predecessors, (88), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 22:50:15,476 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from false [2025-03-08 22:50:15,482 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from true [2025-03-08 22:50:15,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2025-03-08 22:50:15,486 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2025-03-08 22:50:15,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (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)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2025-03-08 22:50:15,490 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (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)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2025-03-08 22:50:15,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (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)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) .cse0)) is different from false [2025-03-08 22:50:15,494 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (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)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) .cse0)) is different from true [2025-03-08 22:50:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:16,139 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2025-03-08 22:50:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:50:16,140 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.75) internal successors, (88), 27 states have internal predecessors, (88), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 120 [2025-03-08 22:50:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:16,141 INFO L225 Difference]: With dead ends: 201 [2025-03-08 22:50:16,141 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 22:50:16,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 223 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=961, Unknown=17, NotChecked=648, Total=1806 [2025-03-08 22:50:16,141 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 10 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1166 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:16,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1976 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1305 Invalid, 0 Unknown, 1166 Unchecked, 0.8s Time] [2025-03-08 22:50:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 22:50:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-08 22:50:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 190 states have internal predecessors, (204), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:50:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2025-03-08 22:50:16,145 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 120 [2025-03-08 22:50:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:16,146 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2025-03-08 22:50:16,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.75) internal successors, (88), 27 states have internal predecessors, (88), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 22:50:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2025-03-08 22:50:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 22:50:16,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:16,146 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:16,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:50:16,347 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:16,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 67 more)] === [2025-03-08 22:50:16,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2087878763, now seen corresponding path program 1 times [2025-03-08 22:50:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531402277] [2025-03-08 22:50:16,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:16,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:16,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:18,291 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:18,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531402277] [2025-03-08 22:50:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531402277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28129566] [2025-03-08 22:50:18,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:18,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:18,293 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:18,295 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:18,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:50:19,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:50:19,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:19,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:19,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-08 22:50:19,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:19,249 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:23,193 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:23,193 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 18 treesize of output 17 [2025-03-08 22:50:23,226 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:50:23,226 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:23,511 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:23,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:23,579 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 18 treesize of output 13 [2025-03-08 22:50:23,597 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 22:50:23,597 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:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 403 proven. 623 refuted. 0 times theorem prover too weak. 163 trivial. 206 not checked. [2025-03-08 22:50:23,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28129566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:23,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:50:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 58 [2025-03-08 22:50:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875950149] [2025-03-08 22:50:23,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:23,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-08 22:50:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:23,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-08 22:50:23,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3332, Unknown=1, NotChecked=116, Total=3660 [2025-03-08 22:50:23,928 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand has 59 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 55 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:28,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:50:32,818 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:36,971 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:41,186 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:45,339 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:49,555 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]