./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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-broom/sll-nested-sll-twice.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:49:11,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:49:11,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:49:11,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:49:11,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:49:11,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:49:11,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:49:11,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:49:11,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:49:11,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:49:11,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:49:11,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:49:11,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:49:11,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:49:11,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:49:11,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:49:11,833 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:49:11,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:49:11,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:49:11,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:49:11,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:49:11,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:49:11,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:49:11,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:11,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:49:11,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:49:11,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:49:11,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:49:11,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:49:11,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:49:11,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:49:11,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:49:11,834 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 [2025-03-04 07:49:12,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:49:12,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:49:12,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:49:12,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:49:12,084 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:49:12,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2025-03-04 07:49:13,195 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3f33c32/f1e5057d0ccf409bb4037415a6d0e832/FLAGf652cd90b [2025-03-04 07:49:13,470 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:49:13,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2025-03-04 07:49:13,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3f33c32/f1e5057d0ccf409bb4037415a6d0e832/FLAGf652cd90b [2025-03-04 07:49:13,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3f33c32/f1e5057d0ccf409bb4037415a6d0e832 [2025-03-04 07:49:13,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:49:13,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:49:13,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:13,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:49:13,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:49:13,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5766f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:13, skipping insertion in model container [2025-03-04 07:49:13,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:13" (1/1) ... [2025-03-04 07:49:13,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:49:13,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:13,990 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:49:14,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:14,038 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:49:14,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14 WrapperNode [2025-03-04 07:49:14,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:14,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:14,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:49:14,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:49:14,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,066 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-03-04 07:49:14,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:14,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:49:14,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:49:14,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:49:14,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,093 INFO L175 MemorySlicer]: Split 22 memory accesses to 1 slices as follows [22]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2025-03-04 07:49:14,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:49:14,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:49:14,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:49:14,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:49:14,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (1/1) ... [2025-03-04 07:49:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:14,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:14,128 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-04 07:49:14,133 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-04 07:49:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure loop_internal [2025-03-04 07:49:14,149 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_internal [2025-03-04 07:49:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-03-04 07:49:14,149 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-03-04 07:49:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2025-03-04 07:49:14,149 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2025-03-04 07:49:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-04 07:49:14,150 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-04 07:49:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:49:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:49:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_internal [2025-03-04 07:49:14,150 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_internal [2025-03-04 07:49:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:49:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:49:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:49:14,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:49:14,226 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:49:14,228 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:49:14,523 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-04 07:49:14,523 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:49:14,535 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:49:14,537 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:49:14,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:14 BoogieIcfgContainer [2025-03-04 07:49:14,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:49:14,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:49:14,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:49:14,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:49:14,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:49:13" (1/3) ... [2025-03-04 07:49:14,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3288590d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:14, skipping insertion in model container [2025-03-04 07:49:14,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:14" (2/3) ... [2025-03-04 07:49:14,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3288590d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:14, skipping insertion in model container [2025-03-04 07:49:14,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:14" (3/3) ... [2025-03-04 07:49:14,546 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-twice.i [2025-03-04 07:49:14,560 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:49:14,562 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll-twice.i that has 6 procedures, 143 locations, 1 initial locations, 6 loop locations, and 51 error locations. [2025-03-04 07:49:14,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:49:14,612 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;@8a0b38f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:49:14,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-04 07:49:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 125 states have internal predecessors, (133), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:14,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:14,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:14,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 131716195, now seen corresponding path program 1 times [2025-03-04 07:49:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151339131] [2025-03-04 07:49:14,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:14,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:14,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,764 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-04 07:49:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151339131] [2025-03-04 07:49:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151339131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714867360] [2025-03-04 07:49:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:14,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:14,794 INFO L87 Difference]: Start difference. First operand has 143 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 125 states have internal predecessors, (133), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 07:49:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,905 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2025-03-04 07:49:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:14,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-04 07:49:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,911 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:49:14,911 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:49:14,912 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-04 07:49:14,914 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:49:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 07:49:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.726027397260274) internal successors, (126), 120 states have internal predecessors, (126), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-03-04 07:49:14,951 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 5 [2025-03-04 07:49:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,951 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-03-04 07:49:14,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 07:49:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-03-04 07:49:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:14,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:49:14,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 131716196, now seen corresponding path program 1 times [2025-03-04 07:49:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914541472] [2025-03-04 07:49:14,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:14,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:14,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,028 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-04 07:49:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914541472] [2025-03-04 07:49:15,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914541472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:15,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075189881] [2025-03-04 07:49:15,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:15,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:15,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:15,030 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 07:49:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,086 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-03-04 07:49:15,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-04 07:49:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,087 INFO L225 Difference]: With dead ends: 135 [2025-03-04 07:49:15,087 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:49:15,088 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-04 07:49:15,088 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:49:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 07:49:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 117 states have internal predecessors, (123), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2025-03-04 07:49:15,099 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 5 [2025-03-04 07:49:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,099 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-03-04 07:49:15,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 07:49:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2025-03-04 07:49:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:49:15,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:49:15,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 662634321, now seen corresponding path program 1 times [2025-03-04 07:49:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968035171] [2025-03-04 07:49:15,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:49:15,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:49:15,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,206 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-04 07:49:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968035171] [2025-03-04 07:49:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968035171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533292775] [2025-03-04 07:49:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:15,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:15,208 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,278 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2025-03-04 07:49:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:15,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 07:49:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,280 INFO L225 Difference]: With dead ends: 134 [2025-03-04 07:49:15,280 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 07:49:15,280 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-04 07:49:15,281 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 238 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 07:49:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 07:49:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 116 states have internal predecessors, (122), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-04 07:49:15,290 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 15 [2025-03-04 07:49:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,291 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-04 07:49:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-04 07:49:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:49:15,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:49:15,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:15,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash 662634322, now seen corresponding path program 1 times [2025-03-04 07:49:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066765828] [2025-03-04 07:49:15,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:49:15,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:49:15,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,429 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-04 07:49:15,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066765828] [2025-03-04 07:49:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066765828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269505535] [2025-03-04 07:49:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:15,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:15,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:15,432 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,496 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2025-03-04 07:49:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:15,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 07:49:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,498 INFO L225 Difference]: With dead ends: 133 [2025-03-04 07:49:15,498 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 07:49:15,498 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-04 07:49:15,499 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 07:49:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 07:49:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 115 states have internal predecessors, (121), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-03-04 07:49:15,512 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 15 [2025-03-04 07:49:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,512 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-03-04 07:49:15,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-03-04 07:49:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:49:15,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:49:15,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:15,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash 65220222, now seen corresponding path program 1 times [2025-03-04 07:49:15,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-03-04 07:49:15,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:49:15,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:49:15,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,752 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-04 07:49:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-03-04 07:49:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006242003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732989901] [2025-03-04 07:49:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:15,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:15,754 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,114 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2025-03-04 07:49:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:16,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-03-04 07:49:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,116 INFO L225 Difference]: With dead ends: 169 [2025-03-04 07:49:16,117 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 07:49:16,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:49:16,117 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 67 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 473 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 07:49:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2025-03-04 07:49:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.6590909090909092) internal successors, (146), 126 states have internal predecessors, (146), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 07:49:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2025-03-04 07:49:16,128 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 25 [2025-03-04 07:49:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2025-03-04 07:49:16,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2025-03-04 07:49:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:49:16,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:16,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:49:16,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:16,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash 65220223, now seen corresponding path program 1 times [2025-03-04 07:49:16,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610679270] [2025-03-04 07:49:16,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:49:16,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:49:16,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,480 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-04 07:49:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610679270] [2025-03-04 07:49:16,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610679270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:16,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:16,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:49:16,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095288042] [2025-03-04 07:49:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:49:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:49:16,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:49:16,484 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,933 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2025-03-04 07:49:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:16,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-03-04 07:49:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,934 INFO L225 Difference]: With dead ends: 187 [2025-03-04 07:49:16,935 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 07:49:16,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:49:16,936 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 90 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 448 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:49:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 07:49:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2025-03-04 07:49:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.607843137254902) internal successors, (164), 140 states have internal predecessors, (164), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (24), 21 states have call predecessors, (24), 17 states have call successors, (24) [2025-03-04 07:49:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2025-03-04 07:49:16,944 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 25 [2025-03-04 07:49:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:16,944 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2025-03-04 07:49:16,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2025-03-04 07:49:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:49:16,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:16,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:49:16,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1656703089, now seen corresponding path program 1 times [2025-03-04 07:49:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154600059] [2025-03-04 07:49:16,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:49:16,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:49:16,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154600059] [2025-03-04 07:49:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154600059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000844486] [2025-03-04 07:49:17,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:17,127 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-04 07:49:17,128 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-04 07:49:17,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:49:17,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:49:17,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:49:17,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:17,219 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-04 07:49:17,245 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-03-04 07:49:17,267 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:17,267 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-04 07:49:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:17,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000844486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:17,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-03-04 07:49:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474749589] [2025-03-04 07:49:17,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:17,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:49:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:17,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:49:17,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:49:17,419 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:49:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,806 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2025-03-04 07:49:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:17,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2025-03-04 07:49:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,807 INFO L225 Difference]: With dead ends: 181 [2025-03-04 07:49:17,807 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 07:49:17,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=164, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:49:17,808 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 125 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 583 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 505 Invalid, 0 Unknown, 167 Unchecked, 0.3s Time] [2025-03-04 07:49:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 07:49:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2025-03-04 07:49:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 140 states have internal predecessors, (165), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-04 07:49:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2025-03-04 07:49:17,818 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 28 [2025-03-04 07:49:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,818 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2025-03-04 07:49:17,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:49:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2025-03-04 07:49:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:49:17,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:17,826 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-04 07:49:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1656703090, now seen corresponding path program 1 times [2025-03-04 07:49:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:18,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88670642] [2025-03-04 07:49:18,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:18,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:49:18,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:49:18,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88670642] [2025-03-04 07:49:18,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88670642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109179679] [2025-03-04 07:49:18,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:18,239 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-04 07:49:18,240 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-04 07:49:18,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:49:18,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:49:18,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:49:18,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:18,321 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-04 07:49:18,407 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-03-04 07:49:18,428 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:18,428 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-04 07:49:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:18,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:18,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109179679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:18,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:18,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-03-04 07:49:18,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027327717] [2025-03-04 07:49:18,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:18,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:49:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:18,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:49:18,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2025-03-04 07:49:18,593 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,149 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2025-03-04 07:49:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:19,149 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2025-03-04 07:49:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,150 INFO L225 Difference]: With dead ends: 169 [2025-03-04 07:49:19,150 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 07:49:19,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2025-03-04 07:49:19,151 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 91 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 750 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 700 Invalid, 0 Unknown, 152 Unchecked, 0.4s Time] [2025-03-04 07:49:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 07:49:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-03-04 07:49:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 103 states have (on average 1.5825242718446602) internal successors, (163), 139 states have internal predecessors, (163), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-04 07:49:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2025-03-04 07:49:19,156 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 28 [2025-03-04 07:49:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,156 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2025-03-04 07:49:19,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2025-03-04 07:49:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:49:19,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:19,163 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-04 07:49:19,358 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,SelfDestructingSolverStorable7 [2025-03-04 07:49:19,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash -787470375, now seen corresponding path program 1 times [2025-03-04 07:49:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95527359] [2025-03-04 07:49:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:19,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:19,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95527359] [2025-03-04 07:49:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95527359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467271956] [2025-03-04 07:49:19,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:19,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:19,731 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-04 07:49:19,733 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-04 07:49:19,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:19,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:19,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:49:19,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:19,800 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-04 07:49:19,876 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-03-04 07:49:19,898 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2025-03-04 07:49:19,900 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2025-03-04 07:49:19,918 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2025-03-04 07:49:19,920 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2025-03-04 07:49:20,020 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:20,021 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-04 07:49:20,036 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2025-03-04 07:49:20,038 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2025-03-04 07:49:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 07:49:20,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467271956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:20,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2025-03-04 07:49:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135853033] [2025-03-04 07:49:20,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:20,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:49:20,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:20,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:49:20,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=240, Unknown=7, NotChecked=140, Total=462 [2025-03-04 07:49:20,229 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:20,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse4 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from false [2025-03-04 07:49:20,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse4 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from true [2025-03-04 07:49:20,436 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-03-04 07:49:20,438 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-03-04 07:49:20,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2025-03-04 07:49:20,449 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2025-03-04 07:49:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:20,887 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2025-03-04 07:49:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:49:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2025-03-04 07:49:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:20,889 INFO L225 Difference]: With dead ends: 198 [2025-03-04 07:49:20,889 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 07:49:20,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=393, Unknown=13, NotChecked=336, Total=870 [2025-03-04 07:49:20,890 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 145 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1049 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:20,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 677 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 770 Invalid, 0 Unknown, 1049 Unchecked, 0.5s Time] [2025-03-04 07:49:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 07:49:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 176. [2025-03-04 07:49:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 147 states have internal predecessors, (173), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-04 07:49:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 223 transitions. [2025-03-04 07:49:20,896 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 223 transitions. Word has length 37 [2025-03-04 07:49:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:20,896 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 223 transitions. [2025-03-04 07:49:20,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 223 transitions. [2025-03-04 07:49:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:49:20,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:20,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:20,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:21,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:21,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:21,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash -787470374, now seen corresponding path program 1 times [2025-03-04 07:49:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014080672] [2025-03-04 07:49:21,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:21,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:21,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:21,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:21,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:21,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:21,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014080672] [2025-03-04 07:49:21,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014080672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:21,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514035640] [2025-03-04 07:49:21,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:21,541 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-04 07:49:21,542 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-04 07:49:21,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:21,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:21,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:21,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:21,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:49:21,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:21,631 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-04 07:49:21,638 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-04 07:49:21,791 WARN L873 $PredicateComparison]: unable to prove that (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (= |c_#length| (store |c_old(#length)| create_internal_~now~0.base (select |c_#length| create_internal_~now~0.base))) (= |c_#valid| (store |c_old(#valid)| create_internal_~now~0.base (select |c_#valid| create_internal_~now~0.base))))) is different from true [2025-03-04 07:49:21,817 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:22,016 INFO L349 Elim1Store]: treesize reduction 71, result has 15.5 percent of original size [2025-03-04 07:49:22,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 76 [2025-03-04 07:49:22,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:22,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-03-04 07:49:22,483 INFO L349 Elim1Store]: treesize reduction 52, result has 8.8 percent of original size [2025-03-04 07:49:22,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 14 [2025-03-04 07:49:22,497 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2025-03-04 07:49:22,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 1 [2025-03-04 07:49:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 07:49:22,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514035640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:22,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2025-03-04 07:49:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834323920] [2025-03-04 07:49:22,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:49:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:49:22,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=428, Unknown=2, NotChecked=86, Total=600 [2025-03-04 07:49:22,702 INFO L87 Difference]: Start difference. First operand 176 states and 223 transitions. Second operand has 23 states, 20 states have (on average 2.7) internal successors, (54), 17 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:49:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:23,721 INFO L93 Difference]: Finished difference Result 225 states and 288 transitions. [2025-03-04 07:49:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:49:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.7) internal successors, (54), 17 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2025-03-04 07:49:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:23,725 INFO L225 Difference]: With dead ends: 225 [2025-03-04 07:49:23,725 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 07:49:23,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=587, Unknown=2, NotChecked=102, Total=812 [2025-03-04 07:49:23,730 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 163 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:23,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 553 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1169 Invalid, 0 Unknown, 461 Unchecked, 0.7s Time] [2025-03-04 07:49:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 07:49:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 182. [2025-03-04 07:49:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 151 states have internal predecessors, (185), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-04 07:49:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2025-03-04 07:49:23,736 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 37 [2025-03-04 07:49:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:23,737 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2025-03-04 07:49:23,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.7) internal successors, (54), 17 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:49:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2025-03-04 07:49:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:49:23,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:23,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:23,748 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-04 07:49:23,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:23,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash -412283594, now seen corresponding path program 1 times [2025-03-04 07:49:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:23,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027902180] [2025-03-04 07:49:23,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:23,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:23,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:23,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:23,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:24,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:24,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027902180] [2025-03-04 07:49:24,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027902180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:24,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371907050] [2025-03-04 07:49:24,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:24,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:24,142 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-04 07:49:24,143 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-04 07:49:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:24,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:24,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:24,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:24,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:49:24,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:24,223 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-04 07:49:24,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:49:24,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:49:24,243 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-03-04 07:49:24,254 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:24,254 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-04 07:49:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 07:49:24,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:24,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371907050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:24,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:24,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-03-04 07:49:24,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142074801] [2025-03-04 07:49:24,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:49:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:24,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:49:24,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:49:24,351 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:49:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:24,735 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2025-03-04 07:49:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:24,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-04 07:49:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:24,737 INFO L225 Difference]: With dead ends: 194 [2025-03-04 07:49:24,737 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 07:49:24,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2025-03-04 07:49:24,738 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 89 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:24,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 770 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 675 Invalid, 0 Unknown, 164 Unchecked, 0.3s Time] [2025-03-04 07:49:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 07:49:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2025-03-04 07:49:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 150 states have internal predecessors, (184), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-04 07:49:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 234 transitions. [2025-03-04 07:49:24,747 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 234 transitions. Word has length 40 [2025-03-04 07:49:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:24,747 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 234 transitions. [2025-03-04 07:49:24,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:49:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 234 transitions. [2025-03-04 07:49:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:49:24,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:24,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:24,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:24,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 07:49:24,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:24,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash -412283593, now seen corresponding path program 1 times [2025-03-04 07:49:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285140163] [2025-03-04 07:49:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:24,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:24,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:24,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:24,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285140163] [2025-03-04 07:49:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285140163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600925695] [2025-03-04 07:49:25,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:25,211 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-04 07:49:25,211 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-04 07:49:25,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:25,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:25,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:25,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:49:25,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:25,292 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-04 07:49:25,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:49:25,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:25,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:49:25,328 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-03-04 07:49:25,340 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:25,340 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-04 07:49:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 07:49:25,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600925695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:25,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2025-03-04 07:49:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120383537] [2025-03-04 07:49:25,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:25,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:49:25,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:25,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:49:25,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:49:25,398 INFO L87 Difference]: Start difference. First operand 181 states and 234 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:49:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:25,779 INFO L93 Difference]: Finished difference Result 180 states and 233 transitions. [2025-03-04 07:49:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-03-04 07:49:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:25,780 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:49:25,780 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:49:25,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2025-03-04 07:49:25,781 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 33 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:25,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 736 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 700 Invalid, 0 Unknown, 150 Unchecked, 0.3s Time] [2025-03-04 07:49:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:49:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 07:49:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 117 states have (on average 1.564102564102564) internal successors, (183), 149 states have internal predecessors, (183), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-04 07:49:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2025-03-04 07:49:25,786 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 40 [2025-03-04 07:49:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:25,786 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2025-03-04 07:49:25,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:49:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2025-03-04 07:49:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:49:25,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:25,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:25,802 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-04 07:49:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:25,993 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:25,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash -436672078, now seen corresponding path program 1 times [2025-03-04 07:49:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824188996] [2025-03-04 07:49:25,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:26,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:49:26,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:49:26,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:26,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:26,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:26,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824188996] [2025-03-04 07:49:26,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824188996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:26,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919489413] [2025-03-04 07:49:26,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:26,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:26,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:26,281 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-04 07:49:26,283 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-04 07:49:26,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:49:26,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:49:26,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:26,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:26,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:49:26,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:26,426 WARN L873 $PredicateComparison]: unable to prove that (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (= |c_#valid| (store |c_old(#valid)| create_internal_~now~0.base (select |c_#valid| create_internal_~now~0.base))))) is different from true [2025-03-04 07:49:26,438 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-03-04 07:49:26,608 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2025-03-04 07:49:26,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2025-03-04 07:49:26,891 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2025-03-04 07:49:26,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2025-03-04 07:49:26,928 INFO L349 Elim1Store]: treesize reduction 43, result has 28.3 percent of original size [2025-03-04 07:49:26,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:49:26,942 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-04 07:49:26,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 14 [2025-03-04 07:49:26,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2025-03-04 07:49:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 07:49:26,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:27,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919489413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:27,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-03-04 07:49:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062888728] [2025-03-04 07:49:27,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:27,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:49:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:27,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:49:27,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=224, Unknown=2, NotChecked=62, Total=342 [2025-03-04 07:49:27,038 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:49:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:27,697 INFO L93 Difference]: Finished difference Result 207 states and 263 transitions. [2025-03-04 07:49:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:27,697 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 52 [2025-03-04 07:49:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:27,699 INFO L225 Difference]: With dead ends: 207 [2025-03-04 07:49:27,699 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 07:49:27,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=442, Unknown=2, NotChecked=90, Total=650 [2025-03-04 07:49:27,699 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 162 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 82 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:27,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 538 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 605 Invalid, 1 Unknown, 401 Unchecked, 0.5s Time] [2025-03-04 07:49:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 07:49:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 170. [2025-03-04 07:49:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 142 states have internal predecessors, (167), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-04 07:49:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2025-03-04 07:49:27,708 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 52 [2025-03-04 07:49:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:27,708 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2025-03-04 07:49:27,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:49:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2025-03-04 07:49:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:49:27,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:27,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:27,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:49:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:27,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:27,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -405259676, now seen corresponding path program 1 times [2025-03-04 07:49:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945949430] [2025-03-04 07:49:27,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:27,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:49:27,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:49:27,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:27,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:49:27,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:27,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945949430] [2025-03-04 07:49:27,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945949430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:27,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:27,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:27,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680944165] [2025-03-04 07:49:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:27,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:27,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:27,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:27,987 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:28,127 INFO L93 Difference]: Finished difference Result 198 states and 256 transitions. [2025-03-04 07:49:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-04 07:49:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:28,129 INFO L225 Difference]: With dead ends: 198 [2025-03-04 07:49:28,129 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 07:49:28,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:28,129 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 28 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:28,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 423 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 07:49:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2025-03-04 07:49:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.5813953488372092) internal successors, (204), 159 states have internal predecessors, (204), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (29), 26 states have call predecessors, (29), 20 states have call successors, (29) [2025-03-04 07:49:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 253 transitions. [2025-03-04 07:49:28,138 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 253 transitions. Word has length 47 [2025-03-04 07:49:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:28,138 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 253 transitions. [2025-03-04 07:49:28,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 253 transitions. [2025-03-04 07:49:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:49:28,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:28,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:28,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:49:28,139 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:28,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash -405259675, now seen corresponding path program 1 times [2025-03-04 07:49:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816697884] [2025-03-04 07:49:28,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:28,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:49:28,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:49:28,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:28,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:49:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816697884] [2025-03-04 07:49:28,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816697884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:28,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:28,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:28,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636946399] [2025-03-04 07:49:28,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:28,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:28,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:28,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:28,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:28,264 INFO L87 Difference]: Start difference. First operand 191 states and 253 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:28,423 INFO L93 Difference]: Finished difference Result 205 states and 266 transitions. [2025-03-04 07:49:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-04 07:49:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:28,426 INFO L225 Difference]: With dead ends: 205 [2025-03-04 07:49:28,426 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 07:49:28,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:28,426 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 22 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:28,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 779 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 07:49:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2025-03-04 07:49:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 167 states have internal predecessors, (213), 22 states have call successors, (22), 5 states have call predecessors, (22), 6 states have return successors, (31), 28 states have call predecessors, (31), 22 states have call successors, (31) [2025-03-04 07:49:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 266 transitions. [2025-03-04 07:49:28,434 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 266 transitions. Word has length 47 [2025-03-04 07:49:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:28,434 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 266 transitions. [2025-03-04 07:49:28,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 266 transitions. [2025-03-04 07:49:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:49:28,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:28,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:28,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:49:28,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:28,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1387494004, now seen corresponding path program 1 times [2025-03-04 07:49:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74158350] [2025-03-04 07:49:28,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:28,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:49:28,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:49:28,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:28,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:49:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74158350] [2025-03-04 07:49:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74158350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:28,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:28,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994439214] [2025-03-04 07:49:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:28,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:28,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:28,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:28,500 INFO L87 Difference]: Start difference. First operand 201 states and 266 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:28,547 INFO L93 Difference]: Finished difference Result 209 states and 278 transitions. [2025-03-04 07:49:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-03-04 07:49:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:28,549 INFO L225 Difference]: With dead ends: 209 [2025-03-04 07:49:28,549 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 07:49:28,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:28,549 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 31 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:28,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 839 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 07:49:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2025-03-04 07:49:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 138 states have (on average 1.536231884057971) internal successors, (212), 168 states have internal predecessors, (212), 22 states have call successors, (22), 5 states have call predecessors, (22), 6 states have return successors, (31), 28 states have call predecessors, (31), 22 states have call successors, (31) [2025-03-04 07:49:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 265 transitions. [2025-03-04 07:49:28,556 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 265 transitions. Word has length 49 [2025-03-04 07:49:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:28,557 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 265 transitions. [2025-03-04 07:49:28,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 265 transitions. [2025-03-04 07:49:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:49:28,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:28,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:28,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:49:28,557 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:28,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1927541934, now seen corresponding path program 1 times [2025-03-04 07:49:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007586993] [2025-03-04 07:49:28,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:28,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:49:28,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:49:28,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:28,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:29,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007586993] [2025-03-04 07:49:29,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007586993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:29,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067892989] [2025-03-04 07:49:29,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:29,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:29,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:29,165 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-04 07:49:29,166 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-04 07:49:29,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:49:29,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:49:29,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:29,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:29,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 07:49:29,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:29,291 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-04 07:49:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:29,388 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2025-03-04 07:49:29,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:29,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 07:49:29,443 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2025-03-04 07:49:29,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2025-03-04 07:49:29,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 07:49:29,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 07:49:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-03-04 07:49:29,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:33,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067892989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:33,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:33,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 31 [2025-03-04 07:49:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345464745] [2025-03-04 07:49:33,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:33,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:49:33,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:33,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:49:33,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1158, Unknown=2, NotChecked=68, Total=1332 [2025-03-04 07:49:33,796 INFO L87 Difference]: Start difference. First operand 202 states and 265 transitions. Second operand has 32 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 25 states have internal predecessors, (65), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:49:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:35,145 INFO L93 Difference]: Finished difference Result 253 states and 330 transitions. [2025-03-04 07:49:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:49:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 25 states have internal predecessors, (65), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 51 [2025-03-04 07:49:35,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:35,146 INFO L225 Difference]: With dead ends: 253 [2025-03-04 07:49:35,146 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 07:49:35,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=183, Invalid=2269, Unknown=2, NotChecked=96, Total=2550 [2025-03-04 07:49:35,147 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 104 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:35,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1524 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2378 Invalid, 0 Unknown, 218 Unchecked, 0.9s Time] [2025-03-04 07:49:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 07:49:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2025-03-04 07:49:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 159 states have (on average 1.5157232704402517) internal successors, (241), 189 states have internal predecessors, (241), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 30 states have call predecessors, (41), 23 states have call successors, (41) [2025-03-04 07:49:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 305 transitions. [2025-03-04 07:49:35,153 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 305 transitions. Word has length 51 [2025-03-04 07:49:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:35,154 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 305 transitions. [2025-03-04 07:49:35,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 25 states have internal predecessors, (65), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:49:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2025-03-04 07:49:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:49:35,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:35,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:35,161 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-04 07:49:35,355 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,SelfDestructingSolverStorable16 [2025-03-04 07:49:35,355 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1927541935, now seen corresponding path program 1 times [2025-03-04 07:49:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646134142] [2025-03-04 07:49:35,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:35,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:49:35,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:49:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:36,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646134142] [2025-03-04 07:49:36,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646134142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:36,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206161563] [2025-03-04 07:49:36,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:36,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:36,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:36,233 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-04 07:49:36,234 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-04 07:49:36,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:49:36,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:49:36,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:36,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:36,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-04 07:49:36,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:36,423 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-04 07:49:36,429 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-04 07:49:36,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:49:36,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:36,728 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse0 (select |c_#length| alloc_and_zero_internal_~pi~1.base))) (and (<= .cse0 8) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base .cse0) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|)))) is different from true [2025-03-04 07:49:36,808 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:49:36,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2025-03-04 07:49:36,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:36,815 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-04 07:49:36,827 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:49:36,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-04 07:49:36,836 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:49:36,836 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 15 treesize of output 15 [2025-03-04 07:49:36,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:49:36,854 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 18 treesize of output 10 [2025-03-04 07:49:36,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 62 [2025-03-04 07:49:36,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2025-03-04 07:49:37,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2025-03-04 07:49:37,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2025-03-04 07:49:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-03-04 07:49:37,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206161563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:37,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2025-03-04 07:49:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017104004] [2025-03-04 07:49:37,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:37,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 07:49:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:37,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 07:49:37,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2400, Unknown=1, NotChecked=98, Total=2652 [2025-03-04 07:49:37,980 INFO L87 Difference]: Start difference. First operand 226 states and 305 transitions. Second operand has 44 states, 39 states have (on average 2.0) internal successors, (78), 33 states have internal predecessors, (78), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 07:49:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:44,830 INFO L93 Difference]: Finished difference Result 281 states and 365 transitions. [2025-03-04 07:49:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 07:49:44,832 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 2.0) internal successors, (78), 33 states have internal predecessors, (78), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) Word has length 51 [2025-03-04 07:49:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:44,833 INFO L225 Difference]: With dead ends: 281 [2025-03-04 07:49:44,833 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 07:49:44,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=295, Invalid=4537, Unknown=2, NotChecked=136, Total=4970 [2025-03-04 07:49:44,834 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 3237 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:44,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2135 Invalid, 3520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3237 Invalid, 1 Unknown, 252 Unchecked, 1.8s Time] [2025-03-04 07:49:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 07:49:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 226. [2025-03-04 07:49:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 159 states have (on average 1.509433962264151) internal successors, (240), 189 states have internal predecessors, (240), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 30 states have call predecessors, (41), 23 states have call successors, (41) [2025-03-04 07:49:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 304 transitions. [2025-03-04 07:49:44,843 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 304 transitions. Word has length 51 [2025-03-04 07:49:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:44,843 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 304 transitions. [2025-03-04 07:49:44,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 2.0) internal successors, (78), 33 states have internal predecessors, (78), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 07:49:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 304 transitions. [2025-03-04 07:49:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:49:44,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:44,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:44,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:45,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 07:49:45,045 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:45,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1982001332, now seen corresponding path program 2 times [2025-03-04 07:49:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:45,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546902755] [2025-03-04 07:49:45,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:45,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 07:49:45,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:49:45,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:49:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546902755] [2025-03-04 07:49:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546902755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099409658] [2025-03-04 07:49:45,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:45,830 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:45,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:49:45,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 07:49:45,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:49:45,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:45,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:45,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 07:49:45,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:45,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:49:46,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1))))) (or (and .cse0 (or (= |c_#valid| |c_old(#valid)|) (= .cse1 |c_create_internal_#t~ret7.base|))) (and .cse0 (= c_create_internal_~now~0.base .cse1)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse2) (= .cse3 |c_create_internal_#t~ret7.base|) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse3 (select |c_#valid| .cse3))))))))) is different from false [2025-03-04 07:49:46,067 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1))))) (or (and .cse0 (or (= |c_#valid| |c_old(#valid)|) (= .cse1 |c_create_internal_#t~ret7.base|))) (and .cse0 (= c_create_internal_~now~0.base .cse1)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse2) (= .cse3 |c_create_internal_#t~ret7.base|) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse3 (select |c_#valid| .cse3))))))))) is different from true [2025-03-04 07:49:46,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:49:46,095 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (or (and .cse0 (= c_create_internal_~now~0.base .cse1)) (and .cse0 (or (= |c_#valid| |c_old(#valid)|) (= .cse1 .cse2))) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse3) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3))) (= .cse4 .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse4 (select |c_#valid| .cse4))))))))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from false [2025-03-04 07:49:46,098 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (or (and .cse0 (= c_create_internal_~now~0.base .cse1)) (and .cse0 (or (= |c_#valid| |c_old(#valid)|) (= .cse1 .cse2))) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse3) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3))) (= .cse4 .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse4 (select |c_#valid| .cse4))))))))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from true [2025-03-04 07:49:46,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2025-03-04 07:49:46,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= .cse0 |c_create_internal_#t~mem8.base|) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse0 (select |c_#valid| .cse0)))))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (= |c_#valid| (store |c_old(#valid)| .cse2 .cse3)) (or (= |c_#valid| |c_old(#valid)|) (= |c_create_internal_#t~mem8.base| .cse2))) (and (= .cse3 1) (= |c_#valid| (store |c_old(#valid)| .cse2 1)))))) is different from false [2025-03-04 07:49:46,181 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= .cse0 |c_create_internal_#t~mem8.base|) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse0 (select |c_#valid| .cse0)))))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (= |c_#valid| (store |c_old(#valid)| .cse2 .cse3)) (or (= |c_#valid| |c_old(#valid)|) (= |c_create_internal_#t~mem8.base| .cse2))) (and (= .cse3 1) (= |c_#valid| (store |c_old(#valid)| .cse2 1)))))) is different from true [2025-03-04 07:49:46,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= (select |c_#valid| .cse0) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse1 (select |c_#valid| .cse1))) (= .cse1 c_create_internal_~now~0.base)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (= |c_#valid| (store |c_old(#valid)| .cse2 1)))) is different from false [2025-03-04 07:49:46,218 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= (select |c_#valid| .cse0) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse1 (select |c_#valid| .cse1))) (= .cse1 c_create_internal_~now~0.base)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (= |c_#valid| (store |c_old(#valid)| .cse2 1)))) is different from true [2025-03-04 07:49:46,279 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-03-04 07:49:46,344 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))) (= (select |v_#valid_BEFORE_CALL_40| .cse1) 1) (= c_create_internal_~now~0.base .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= c_create_internal_~now~0.base .cse2) (= (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2025-03-04 07:49:46,347 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))) (= (select |v_#valid_BEFORE_CALL_40| .cse1) 1) (= c_create_internal_~now~0.base .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= c_create_internal_~now~0.base .cse2) (= (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2025-03-04 07:49:46,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1) (= (select |c_#valid| .cse1) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= (select |c_#valid| .cse3) 1) (= (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)) |v_#valid_BEFORE_CALL_40|)))) (and .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1))))))) is different from false [2025-03-04 07:49:46,392 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1) (= (select |c_#valid| .cse1) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= (select |c_#valid| .cse3) 1) (= (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)) |v_#valid_BEFORE_CALL_40|)))) (and .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1))))))) is different from true [2025-03-04 07:49:46,630 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 07:49:46,630 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 3 case distinctions, treesize of input 17 treesize of output 22 [2025-03-04 07:49:46,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= 1 (select |c_#valid| .cse0))))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|) 1)) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_38|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2))) (= (store |v_old(#valid)_AFTER_CALL_46| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)) |v_#valid_BEFORE_CALL_38|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| .cse3) 1) (= (select |c_#valid| .cse2) 1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) is different from false [2025-03-04 07:49:46,759 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= 1 (select |c_#valid| .cse0))))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|) 1)) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_38|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2))) (= (store |v_old(#valid)_AFTER_CALL_46| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)) |v_#valid_BEFORE_CALL_38|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| .cse3) 1) (= (select |c_#valid| .cse2) 1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) is different from true [2025-03-04 07:49:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2025-03-04 07:49:46,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099409658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:47,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2025-03-04 07:49:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094899281] [2025-03-04 07:49:47,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:47,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:49:47,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:47,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:49:47,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=490, Unknown=15, NotChecked=424, Total=1056 [2025-03-04 07:49:47,004 INFO L87 Difference]: Start difference. First operand 226 states and 304 transitions. Second operand has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 07:49:47,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse11 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse11))) (let ((.cse9 (@diff .cse17 |c_#valid|))) (let ((.cse12 (select |c_#valid| .cse9))) (let ((.cse16 (store .cse17 .cse9 .cse12))) (let ((.cse14 (@diff .cse16 |c_#valid|))) (let ((.cse5 (= .cse2 |c_create_internal_#t~ret7.base|)) (.cse13 (select |c_#valid| .cse14)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse10 (= (select |c_old(#valid)| .cse9) 0)) (.cse4 (= |c_#valid| .cse17)) (.cse15 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse6 (= c_create_internal_~now~0.base .cse2))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (and .cse4 (or .cse0 .cse5)) (and .cse4 .cse6) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse7 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse7) (= .cse8 |c_create_internal_#t~ret7.base|) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse7 (select |v_#valid_BEFORE_CALL_38| .cse7))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse8 (select |c_#valid| .cse8))))))) (or .cse0 .cse5 .cse1) (or (= .cse9 |c_create_internal_#t~mem8.base|) .cse10 .cse4) (or .cse0 .cse1 (= .cse11 1)) (or (= .cse12 1) .cse10 .cse4) (or (= .cse13 1) (= (select |c_old(#valid)| .cse14) 0) .cse15) (or (= .cse9 |c_create_internal_#t~ret7.base|) .cse10 .cse4) (= |c_#valid| (store .cse16 .cse14 .cse13)) (or (= .cse9 c_create_internal_~now~0.base) .cse10 .cse4) (or (= .cse9 .cse3) .cse10 .cse4) .cse15 (or .cse0 .cse1 .cse6)))))))))) is different from false [2025-03-04 07:49:47,247 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse11 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse11))) (let ((.cse9 (@diff .cse17 |c_#valid|))) (let ((.cse12 (select |c_#valid| .cse9))) (let ((.cse16 (store .cse17 .cse9 .cse12))) (let ((.cse14 (@diff .cse16 |c_#valid|))) (let ((.cse5 (= .cse2 |c_create_internal_#t~ret7.base|)) (.cse13 (select |c_#valid| .cse14)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse10 (= (select |c_old(#valid)| .cse9) 0)) (.cse4 (= |c_#valid| .cse17)) (.cse15 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse6 (= c_create_internal_~now~0.base .cse2))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (and .cse4 (or .cse0 .cse5)) (and .cse4 .cse6) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse7 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse7) (= .cse8 |c_create_internal_#t~ret7.base|) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse7 (select |v_#valid_BEFORE_CALL_38| .cse7))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse8 (select |c_#valid| .cse8))))))) (or .cse0 .cse5 .cse1) (or (= .cse9 |c_create_internal_#t~mem8.base|) .cse10 .cse4) (or .cse0 .cse1 (= .cse11 1)) (or (= .cse12 1) .cse10 .cse4) (or (= .cse13 1) (= (select |c_old(#valid)| .cse14) 0) .cse15) (or (= .cse9 |c_create_internal_#t~ret7.base|) .cse10 .cse4) (= |c_#valid| (store .cse16 .cse14 .cse13)) (or (= .cse9 c_create_internal_~now~0.base) .cse10 .cse4) (or (= .cse9 .cse3) .cse10 .cse4) .cse15 (or .cse0 .cse1 .cse6)))))))))) is different from true [2025-03-04 07:49:47,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse13))) (let ((.cse16 (store |c_old(#valid)| .cse13 .cse3))) (let ((.cse11 (@diff .cse16 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse11))) (let ((.cse10 (store .cse16 .cse11 .cse4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (@diff .cse10 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse13) 0)) (.cse7 (select |c_#valid| .cse8)) (.cse5 (= (select |c_old(#valid)| .cse11) 0)) (.cse6 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= .cse13 .cse12)) (.cse9 (= |c_#valid| .cse10))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (= |c_#valid| (store .cse10 .cse8 .cse7)) (or (= .cse11 .cse12) .cse5 .cse6) (or (and .cse6 (= c_create_internal_~now~0.base .cse13)) (and .cse6 (or .cse0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse14 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse15 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse14) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse14 (select |v_#valid_BEFORE_CALL_38| .cse14))) (= .cse15 .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse15 (select |c_#valid| .cse15))))))) .cse9 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from false [2025-03-04 07:49:47,261 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse13))) (let ((.cse16 (store |c_old(#valid)| .cse13 .cse3))) (let ((.cse11 (@diff .cse16 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse11))) (let ((.cse10 (store .cse16 .cse11 .cse4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (@diff .cse10 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse13) 0)) (.cse7 (select |c_#valid| .cse8)) (.cse5 (= (select |c_old(#valid)| .cse11) 0)) (.cse6 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= .cse13 .cse12)) (.cse9 (= |c_#valid| .cse10))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (= |c_#valid| (store .cse10 .cse8 .cse7)) (or (= .cse11 .cse12) .cse5 .cse6) (or (and .cse6 (= c_create_internal_~now~0.base .cse13)) (and .cse6 (or .cse0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse14 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse15 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= c_create_internal_~now~0.base .cse14) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse14 (select |v_#valid_BEFORE_CALL_38| .cse14))) (= .cse15 .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse15 (select |c_#valid| .cse15))))))) .cse9 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from true [2025-03-04 07:49:47,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse15 (select |c_#valid| .cse14))) (let ((.cse16 (store |c_old(#valid)| .cse14 .cse15))) (let ((.cse3 (@diff .cse16 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse16 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse14) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse5 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= |c_create_internal_#t~mem8.base| .cse14)) (.cse6 (= .cse15 1)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 .cse6) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= .cse12 |c_create_internal_#t~mem8.base|) (= (select |c_#valid| .cse13) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse13 (select |v_#valid_BEFORE_CALL_38| .cse13))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse12 (select |c_#valid| .cse12)))))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse5 (or .cse0 .cse2)) (and .cse6 (= |c_#valid| (store |c_old(#valid)| .cse14 1)))) .cse10))))))))) is different from false [2025-03-04 07:49:47,276 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse15 (select |c_#valid| .cse14))) (let ((.cse16 (store |c_old(#valid)| .cse14 .cse15))) (let ((.cse3 (@diff .cse16 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse16 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse14) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse5 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= |c_create_internal_#t~mem8.base| .cse14)) (.cse6 (= .cse15 1)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 .cse6) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= .cse12 |c_create_internal_#t~mem8.base|) (= (select |c_#valid| .cse13) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse13 (select |v_#valid_BEFORE_CALL_38| .cse13))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse12 (select |c_#valid| .cse12)))))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse5 (or .cse0 .cse2)) (and .cse6 (= |c_#valid| (store |c_old(#valid)| .cse14 1)))) .cse10))))))))) is different from true [2025-03-04 07:49:47,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse14))) (let ((.cse15 (store |c_old(#valid)| .cse14 .cse2))) (let ((.cse10 (@diff .cse15 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse15 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse15)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse14) 0)) (.cse13 (= c_create_internal_~now~0.base .cse14))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= (select |c_#valid| .cse11) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse11 (select |v_#valid_BEFORE_CALL_38| .cse11))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse12 (select |c_#valid| .cse12))) (= .cse12 c_create_internal_~now~0.base)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (or .cse0 .cse13) .cse5) (= |c_#valid| (store |c_old(#valid)| .cse14 1))) .cse8 (or .cse0 .cse1 .cse13)))))))))) is different from false [2025-03-04 07:49:47,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse14))) (let ((.cse15 (store |c_old(#valid)| .cse14 .cse2))) (let ((.cse10 (@diff .cse15 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse15 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse15)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse14) 0)) (.cse13 (= c_create_internal_~now~0.base .cse14))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= (select |c_#valid| .cse11) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse11 (select |v_#valid_BEFORE_CALL_38| .cse11))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse12 (select |c_#valid| .cse12))) (= .cse12 c_create_internal_~now~0.base)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (or .cse0 .cse13) .cse5) (= |c_#valid| (store |c_old(#valid)| .cse14 1))) .cse8 (or .cse0 .cse1 .cse13)))))))))) is different from true [2025-03-04 07:49:47,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (let ((.cse1 (= |c_#valid| .cse7)) (.cse0 (@diff .cse7 |c_#valid|)) (.cse4 (= |c_#valid| |c_old(#valid)|)) (.cse5 (= c_create_internal_~now~0.base .cse6))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) .cse1) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= (select |c_#valid| .cse2) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse3 (select |c_#valid| .cse3))) (= .cse3 c_create_internal_~now~0.base)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (or .cse4 .cse5) .cse1) (= |c_#valid| (store |c_old(#valid)| .cse6 1))) (= |c_#valid| (store .cse7 .cse0 (select |c_#valid| .cse0))) (or .cse4 (= (select |c_old(#valid)| .cse6) 0) .cse5))))) is different from false [2025-03-04 07:49:47,311 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (let ((.cse1 (= |c_#valid| .cse7)) (.cse0 (@diff .cse7 |c_#valid|)) (.cse4 (= |c_#valid| |c_old(#valid)|)) (.cse5 (= c_create_internal_~now~0.base .cse6))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) .cse1) (or (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_38| |c_#valid|))) (and (= (select |c_#valid| .cse2) 1) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_38| .cse3 (select |c_#valid| .cse3))) (= .cse3 c_create_internal_~now~0.base)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) (or .cse4 .cse5) .cse1) (= |c_#valid| (store |c_old(#valid)| .cse6 1))) (= |c_#valid| (store .cse7 .cse0 (select |c_#valid| .cse0))) (or .cse4 (= (select |c_old(#valid)| .cse6) 0) .cse5))))) is different from true [2025-03-04 07:49:47,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse9 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse8 (select |v_#valid_BEFORE_CALL_40| .cse8))) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse9 (select |v_#valid_BEFORE_CALL_38| .cse9))) (= (select |v_#valid_BEFORE_CALL_40| .cse9) 1) (= c_create_internal_~now~0.base .cse8)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse10 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= c_create_internal_~now~0.base .cse10) (= (store |c_old(#valid)| .cse10 (select |v_#valid_BEFORE_CALL_40| .cse10)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from false [2025-03-04 07:49:47,629 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse9 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse8 (select |v_#valid_BEFORE_CALL_40| .cse8))) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse9 (select |v_#valid_BEFORE_CALL_38| .cse9))) (= (select |v_#valid_BEFORE_CALL_40| .cse9) 1) (= c_create_internal_~now~0.base .cse8)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse10 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= c_create_internal_~now~0.base .cse10) (= (store |c_old(#valid)| .cse10 (select |v_#valid_BEFORE_CALL_40| .cse10)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from true [2025-03-04 07:49:47,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (let ((.cse8 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse8 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse9 (select |v_#valid_BEFORE_CALL_40| .cse9))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse10 (select |v_#valid_BEFORE_CALL_38| .cse10))) (= (select |v_#valid_BEFORE_CALL_40| .cse10) 1) (= (select |c_#valid| .cse9) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse11 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= (select |c_#valid| .cse11) 1) (= (store |c_old(#valid)| .cse11 (select |v_#valid_BEFORE_CALL_40| .cse11)) |v_#valid_BEFORE_CALL_40|)))) (and .cse8 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1)))))))))))))))) is different from false [2025-03-04 07:49:47,665 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (let ((.cse8 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse8 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_38|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse9 (select |v_#valid_BEFORE_CALL_40| .cse9))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_38| (store |c_old(#valid)| .cse10 (select |v_#valid_BEFORE_CALL_38| .cse10))) (= (select |v_#valid_BEFORE_CALL_40| .cse10) 1) (= (select |c_#valid| .cse9) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse11 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= (select |c_#valid| .cse11) 1) (= (store |c_old(#valid)| .cse11 (select |v_#valid_BEFORE_CALL_40| .cse11)) |v_#valid_BEFORE_CALL_40|)))) (and .cse8 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|) 1)))))))))))))))) is different from true [2025-03-04 07:49:47,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (let ((.cse2 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= 1 (select |c_#valid| .cse1))))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse2 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (and .cse2 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|) 1)) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_38|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3))) (= (store |v_old(#valid)_AFTER_CALL_46| .cse4 (select |v_#valid_BEFORE_CALL_38| .cse4)) |v_#valid_BEFORE_CALL_38|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| .cse4) 1) (= (select |c_#valid| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))))))) is different from false [2025-03-04 07:49:47,750 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (let ((.cse2 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= (select |v_#valid_BEFORE_CALL_40| v_create_internal_~now~0.base_33) 1) (= 1 (select |c_#valid| .cse1))))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse2 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (and .cse2 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_46| (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_40|) 1)) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_38| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_38|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_38| |v_#valid_BEFORE_CALL_40|))) (and (= |v_#valid_BEFORE_CALL_40| (store |v_#valid_BEFORE_CALL_38| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3))) (= (store |v_old(#valid)_AFTER_CALL_46| .cse4 (select |v_#valid_BEFORE_CALL_38| .cse4)) |v_#valid_BEFORE_CALL_38|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_40| .cse4) 1) (= (select |c_#valid| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~1#1.base|) 1))))))) is different from true [2025-03-04 07:49:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:48,081 INFO L93 Difference]: Finished difference Result 258 states and 351 transitions. [2025-03-04 07:49:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:49:48,081 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2025-03-04 07:49:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:48,082 INFO L225 Difference]: With dead ends: 258 [2025-03-04 07:49:48,082 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 07:49:48,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=731, Unknown=31, NotChecked=1168, Total=2162 [2025-03-04 07:49:48,083 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 113 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2273 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:48,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 842 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 953 Invalid, 0 Unknown, 2273 Unchecked, 0.7s Time] [2025-03-04 07:49:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 07:49:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 237. [2025-03-04 07:49:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 168 states have (on average 1.494047619047619) internal successors, (251), 198 states have internal predecessors, (251), 24 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (51), 32 states have call predecessors, (51), 24 states have call successors, (51) [2025-03-04 07:49:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 326 transitions. [2025-03-04 07:49:48,089 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 326 transitions. Word has length 49 [2025-03-04 07:49:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:48,090 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 326 transitions. [2025-03-04 07:49:48,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 07:49:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 326 transitions. [2025-03-04 07:49:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:49:48,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:48,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:48,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:49:48,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:48,291 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-03-04 07:49:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1982001333, now seen corresponding path program 2 times [2025-03-04 07:49:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077899412] [2025-03-04 07:49:48,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:48,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 07:49:48,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:49:48,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:48,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:49:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077899412] [2025-03-04 07:49:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077899412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985581194] [2025-03-04 07:49:48,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:48,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:48,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:48,919 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:48,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:49:48,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 07:49:49,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:49:49,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:49,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:49:49,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:49,028 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-04 07:49:49,029 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-04 07:49:49,129 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:49,415 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:50,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:50,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 178 treesize of output 448 [2025-03-04 07:49:50,255 INFO L349 Elim1Store]: treesize reduction 236, result has 12.6 percent of original size [2025-03-04 07:49:50,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 110 treesize of output 267