./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-data.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-middle-data.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 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:49:06,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:49:06,126 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:06,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:49:06,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:49:06,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:49:06,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:49:06,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:49:06,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:49:06,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:49:06,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:49:06,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:49:06,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:49:06,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:49:06,149 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:49:06,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:49:06,150 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:49:06,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:06,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:49:06,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:49:06,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:49:06,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:49:06,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:49:06,152 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 -> 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e [2025-03-04 07:49:06,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:49:06,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:49:06,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:49:06,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:49:06,367 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:49:06,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2025-03-04 07:49:07,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45473b3c0/3e7eeaa997004f9c830ecd39e0dc71db/FLAG207b54659 [2025-03-04 07:49:07,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:49:07,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2025-03-04 07:49:07,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45473b3c0/3e7eeaa997004f9c830ecd39e0dc71db/FLAG207b54659 [2025-03-04 07:49:07,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45473b3c0/3e7eeaa997004f9c830ecd39e0dc71db [2025-03-04 07:49:07,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:49:07,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:49:07,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:07,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:49:07,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:49:07,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322b4289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07, skipping insertion in model container [2025-03-04 07:49:07,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:49:08,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:08,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:49:08,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:08,065 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:49:08,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:08 WrapperNode [2025-03-04 07:49:08,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:08,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:08,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:49:08,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:49:08,071 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:08" (1/1) ... [2025-03-04 07:49:08,078 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:08" (1/1) ... [2025-03-04 07:49:08,095 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2025-03-04 07:49:08,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:08,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:49:08,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:49:08,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:49:08,101 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:08" (1/1) ... [2025-03-04 07:49:08,102 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:08" (1/1) ... [2025-03-04 07:49:08,104 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:08" (1/1) ... [2025-03-04 07:49:08,113 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2025-03-04 07:49:08,114 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:08" (1/1) ... [2025-03-04 07:49:08,114 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:08" (1/1) ... [2025-03-04 07:49:08,118 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:08" (1/1) ... [2025-03-04 07:49:08,118 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:08" (1/1) ... [2025-03-04 07:49:08,119 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:08" (1/1) ... [2025-03-04 07:49:08,120 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:08" (1/1) ... [2025-03-04 07:49:08,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:49:08,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:49:08,121 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:49:08,121 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:49:08,122 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:08" (1/1) ... [2025-03-04 07:49:08,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:08,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:08,146 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:08,148 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:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:49:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-04 07:49:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-04 07:49:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:49:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:49:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:49:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:49:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:49:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:49:08,233 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:49:08,235 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:49:08,423 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-04 07:49:08,425 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:49:08,432 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:49:08,432 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:49:08,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:08 BoogieIcfgContainer [2025-03-04 07:49:08,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:49:08,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:49:08,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:49:08,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:49:08,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:49:07" (1/3) ... [2025-03-04 07:49:08,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d539534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:08, skipping insertion in model container [2025-03-04 07:49:08,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:08" (2/3) ... [2025-03-04 07:49:08,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d539534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:08, skipping insertion in model container [2025-03-04 07:49:08,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:08" (3/3) ... [2025-03-04 07:49:08,439 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-middle-data.i [2025-03-04 07:49:08,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:49:08,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-middle-data.i that has 2 procedures, 71 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-03-04 07:49:08,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:49:08,487 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;@65cb6744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:49:08,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 07:49:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:08,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:08,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 98265259, now seen corresponding path program 1 times [2025-03-04 07:49:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457060634] [2025-03-04 07:49:08,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:08,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:08,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,645 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:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457060634] [2025-03-04 07:49:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457060634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913886006] [2025-03-04 07:49:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:08,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:08,664 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:08,717 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-03-04 07:49:08,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:08,718 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:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:08,722 INFO L225 Difference]: With dead ends: 70 [2025-03-04 07:49:08,722 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 07:49:08,723 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:08,725 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:08,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 07:49:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-04 07:49:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.675) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-03-04 07:49:08,749 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 5 [2025-03-04 07:49:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:08,749 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-03-04 07:49:08,749 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:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-03-04 07:49:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:08,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:08,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:49:08,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:08,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 98265260, now seen corresponding path program 1 times [2025-03-04 07:49:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105886697] [2025-03-04 07:49:08,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:08,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:08,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,832 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:08,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105886697] [2025-03-04 07:49:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105886697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:08,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103689846] [2025-03-04 07:49:08,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:08,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:08,833 INFO L87 Difference]: Start difference. First operand 68 states and 71 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:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:08,878 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-03-04 07:49:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:08,879 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:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:08,879 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:49:08,879 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:49:08,879 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:08,880 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:08,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:49:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 07:49:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.65) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2025-03-04 07:49:08,883 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 5 [2025-03-04 07:49:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:08,884 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2025-03-04 07:49:08,884 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:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2025-03-04 07:49:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:49:08,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:08,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:49:08,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:08,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,886 INFO L85 PathProgramCache]: Analyzing trace with hash 86041853, now seen corresponding path program 1 times [2025-03-04 07:49:08,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115913383] [2025-03-04 07:49:08,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:49:08,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:49:08,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,987 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:08,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115913383] [2025-03-04 07:49:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115913383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765808804] [2025-03-04 07:49:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:08,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:08,990 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:09,097 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2025-03-04 07:49:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:49:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-04 07:49:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:09,099 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:49:09,099 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:49:09,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:09,100 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:09,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 166 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:49:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2025-03-04 07:49:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.525) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-04 07:49:09,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10 [2025-03-04 07:49:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-04 07:49:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-04 07:49:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:49:09,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:09,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:49:09,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 86041854, now seen corresponding path program 1 times [2025-03-04 07:49:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586306854] [2025-03-04 07:49:09,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:09,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:49:09,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:49:09,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:09,265 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:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:09,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586306854] [2025-03-04 07:49:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586306854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384393050] [2025-03-04 07:49:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:09,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:09,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:09,266 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:09,331 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2025-03-04 07:49:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:49:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-04 07:49:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:09,332 INFO L225 Difference]: With dead ends: 66 [2025-03-04 07:49:09,332 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 07:49:09,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:09,333 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:09,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 220 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 07:49:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2025-03-04 07:49:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.5) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-04 07:49:09,337 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 10 [2025-03-04 07:49:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:09,337 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-04 07:49:09,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-04 07:49:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:49:09,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:09,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:09,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:49:09,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:09,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1081843259, now seen corresponding path program 1 times [2025-03-04 07:49:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909702030] [2025-03-04 07:49:09,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:09,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:49:09,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:49:09,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:09,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:09,484 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:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:09,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909702030] [2025-03-04 07:49:09,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909702030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:09,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:09,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954219515] [2025-03-04 07:49:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:09,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:09,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:09,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:09,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:09,486 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:09,560 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2025-03-04 07:49:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:49:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 07:49:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:09,561 INFO L225 Difference]: With dead ends: 65 [2025-03-04 07:49:09,561 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:49:09,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:09,561 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:09,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:49:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2025-03-04 07:49:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.475) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2025-03-04 07:49:09,570 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 12 [2025-03-04 07:49:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:09,570 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2025-03-04 07:49:09,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2025-03-04 07:49:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:49:09,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:09,571 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] [2025-03-04 07:49:09,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:49:09,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:09,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -902298920, now seen corresponding path program 1 times [2025-03-04 07:49:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:09,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986894951] [2025-03-04 07:49:09,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:09,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:09,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:09,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:09,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:09,675 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:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986894951] [2025-03-04 07:49:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986894951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:49:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724819725] [2025-03-04 07:49:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:09,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:09,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:09,681 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:09,803 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-03-04 07:49:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-04 07:49:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:09,804 INFO L225 Difference]: With dead ends: 68 [2025-03-04 07:49:09,805 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 07:49:09,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:09,806 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:09,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 07:49:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-04 07:49:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-03-04 07:49:09,815 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20 [2025-03-04 07:49:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:09,815 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-03-04 07:49:09,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-03-04 07:49:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:49:09,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:09,816 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] [2025-03-04 07:49:09,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:49:09,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:09,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash -902298919, now seen corresponding path program 1 times [2025-03-04 07:49:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761683160] [2025-03-04 07:49:09,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:09,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:09,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:09,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:09,993 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:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761683160] [2025-03-04 07:49:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761683160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:49:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677328941] [2025-03-04 07:49:09,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:09,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:09,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:09,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:09,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:09,995 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:10,098 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-03-04 07:49:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-04 07:49:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:10,100 INFO L225 Difference]: With dead ends: 68 [2025-03-04 07:49:10,100 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 07:49:10,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:10,100 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:10,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 07:49:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-04 07:49:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.446808510638298) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2025-03-04 07:49:10,106 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 20 [2025-03-04 07:49:10,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:10,106 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2025-03-04 07:49:10,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2025-03-04 07:49:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:49:10,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:10,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:10,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:49:10,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:10,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1764127093, now seen corresponding path program 1 times [2025-03-04 07:49:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:10,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-04 07:49:10,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:10,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:49:10,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:49:10,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:10,292 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:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-04 07:49:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806204517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213523823] [2025-03-04 07:49:10,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:10,296 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:10,297 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:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:49:10,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:49:10,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:10,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:49:10,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:10,430 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-03-04 07:49:10,480 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:49:10,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:49:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:10,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213523823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:10,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-03-04 07:49:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780526614] [2025-03-04 07:49:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:10,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:49:10,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:10,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:49:10,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:49:10,488 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:10,531 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2025-03-04 07:49:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:49:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-04 07:49:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:10,533 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:49:10,533 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:49:10,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:49:10,533 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:10,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 99 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 81 Unchecked, 0.0s Time] [2025-03-04 07:49:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:49:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 07:49:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 64 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-03-04 07:49:10,537 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 22 [2025-03-04 07:49:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:10,537 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-03-04 07:49:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-03-04 07:49:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:49:10,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:10,537 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:10,544 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:10,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:10,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1764127094, now seen corresponding path program 1 times [2025-03-04 07:49:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:10,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-03-04 07:49:10,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:10,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:49:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:49:10,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,046 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:11,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-03-04 07:49:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980326773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999483817] [2025-03-04 07:49:11,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:11,049 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:11,051 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:11,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:49:11,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:49:11,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:49:11,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:11,208 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-04 07:49:11,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:11,246 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 16 treesize of output 11 [2025-03-04 07:49:11,256 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:11,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999483817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:11,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:11,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-03-04 07:49:11,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563124148] [2025-03-04 07:49:11,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:11,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:11,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:11,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:11,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2025-03-04 07:49:11,279 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:11,351 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2025-03-04 07:49:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-04 07:49:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:11,352 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:49:11,352 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 07:49:11,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2025-03-04 07:49:11,353 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:11,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 139 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2025-03-04 07:49:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 07:49:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-03-04 07:49:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2025-03-04 07:49:11,358 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 22 [2025-03-04 07:49:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:11,359 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2025-03-04 07:49:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2025-03-04 07:49:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:49:11,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:11,359 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] [2025-03-04 07:49:11,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:11,564 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,SelfDestructingSolverStorable8 [2025-03-04 07:49:11,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:11,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2093529401, now seen corresponding path program 1 times [2025-03-04 07:49:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-04 07:49:11,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:11,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:49:11,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:49:11,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,636 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:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-04 07:49:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897465717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553661428] [2025-03-04 07:49:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:11,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:11,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:11,638 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:11,675 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2025-03-04 07:49:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:11,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 07:49:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:11,676 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:49:11,676 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:49:11,676 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:11,676 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:11,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 352 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:49:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-03-04 07:49:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2025-03-04 07:49:11,680 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 21 [2025-03-04 07:49:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:11,680 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2025-03-04 07:49:11,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2025-03-04 07:49:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:49:11,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:11,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:11,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:49:11,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:11,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash 373792858, now seen corresponding path program 1 times [2025-03-04 07:49:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158342033] [2025-03-04 07:49:11,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:11,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:49:11,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:49:11,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158342033] [2025-03-04 07:49:12,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158342033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924242572] [2025-03-04 07:49:12,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:12,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:12,155 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:12,156 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:12,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:49:12,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:49:12,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:12,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:12,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 07:49:12,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:12,239 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:12,245 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:12,367 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 25 treesize of output 13 [2025-03-04 07:49:12,374 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 25 treesize of output 13 [2025-03-04 07:49:12,392 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 29 treesize of output 13 [2025-03-04 07:49:12,396 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 29 treesize of output 13 [2025-03-04 07:49:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:12,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924242572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:12,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 21 [2025-03-04 07:49:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977235876] [2025-03-04 07:49:12,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:12,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:49:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:12,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:49:12,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:49:12,681 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:12,834 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-03-04 07:49:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:12,834 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-04 07:49:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:12,835 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:49:12,835 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:49:12,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:49:12,836 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:12,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 599 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:49:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 07:49:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-03-04 07:49:12,838 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 24 [2025-03-04 07:49:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:12,839 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-03-04 07:49:12,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-03-04 07:49:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:12,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:12,839 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] [2025-03-04 07:49:12,846 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:13,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:13,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:13,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1526632208, now seen corresponding path program 1 times [2025-03-04 07:49:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-03-04 07:49:13,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:13,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-03-04 07:49:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340271110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730938619] [2025-03-04 07:49:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:13,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:13,196 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,280 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-03-04 07:49:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 07:49:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,281 INFO L225 Difference]: With dead ends: 81 [2025-03-04 07:49:13,281 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 07:49:13,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:13,282 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 233 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 07:49:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 07:49:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-03-04 07:49:13,284 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 26 [2025-03-04 07:49:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,284 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-03-04 07:49:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-03-04 07:49:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:13,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,288 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] [2025-03-04 07:49:13,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:49:13,288 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1526632209, now seen corresponding path program 1 times [2025-03-04 07:49:13,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734157462] [2025-03-04 07:49:13,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:13,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734157462] [2025-03-04 07:49:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734157462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608178899] [2025-03-04 07:49:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:13,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:13,370 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,448 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2025-03-04 07:49:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 07:49:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,448 INFO L225 Difference]: With dead ends: 80 [2025-03-04 07:49:13,448 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 07:49:13,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:13,449 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 07:49:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 07:49:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2025-03-04 07:49:13,451 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 26 [2025-03-04 07:49:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,451 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2025-03-04 07:49:13,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2025-03-04 07:49:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:49:13,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,452 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:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:49:13,452 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1297298441, now seen corresponding path program 1 times [2025-03-04 07:49:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-03-04 07:49:13,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:49:13,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:49:13,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-03-04 07:49:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647159618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813859726] [2025-03-04 07:49:13,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:13,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,542 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,650 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-03-04 07:49:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:13,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:49:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,651 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:49:13,652 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:49:13,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,652 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 226 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:49:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 07:49:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.328125) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-03-04 07:49:13,654 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 25 [2025-03-04 07:49:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-03-04 07:49:13,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-03-04 07:49:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:49:13,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,656 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:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:49:13,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1297298440, now seen corresponding path program 1 times [2025-03-04 07:49:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410533662] [2025-03-04 07:49:13,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:49:13,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:49:13,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410533662] [2025-03-04 07:49:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410533662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758364949] [2025-03-04 07:49:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,803 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,917 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-03-04 07:49:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:49:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,918 INFO L225 Difference]: With dead ends: 84 [2025-03-04 07:49:13,918 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 07:49:13,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,919 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 244 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 07:49:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 07:49:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.303030303030303) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2025-03-04 07:49:13,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 25 [2025-03-04 07:49:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,921 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-03-04 07:49:13,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2025-03-04 07:49:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:13,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,922 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, 1] [2025-03-04 07:49:13,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:49:13,922 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:13,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1561545318, now seen corresponding path program 1 times [2025-03-04 07:49:13,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729890745] [2025-03-04 07:49:13,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:13,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:13,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:13,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729890745] [2025-03-04 07:49:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729890745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592253610] [2025-03-04 07:49:13,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:13,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,986 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,036 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-03-04 07:49:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:14,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 07:49:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,038 INFO L225 Difference]: With dead ends: 91 [2025-03-04 07:49:14,038 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 07:49:14,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:14,039 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 354 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 07:49:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2025-03-04 07:49:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-03-04 07:49:14,041 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 26 [2025-03-04 07:49:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,041 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-03-04 07:49:14,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-03-04 07:49:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:49:14,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,042 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, 1, 1, 1] [2025-03-04 07:49:14,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:49:14,043 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:14,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1702140391, now seen corresponding path program 1 times [2025-03-04 07:49:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998185862] [2025-03-04 07:49:14,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:49:14,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:49:14,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998185862] [2025-03-04 07:49:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998185862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307481374] [2025-03-04 07:49:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:14,129 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,194 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2025-03-04 07:49:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:14,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 07:49:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,195 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:49:14,195 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:49:14,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:14,196 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 322 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:49:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-04 07:49:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2025-03-04 07:49:14,198 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2025-03-04 07:49:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,199 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2025-03-04 07:49:14,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2025-03-04 07:49:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:49:14,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,203 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, 1, 1] [2025-03-04 07:49:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:49:14,203 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:14,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1945657705, now seen corresponding path program 1 times [2025-03-04 07:49:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897758149] [2025-03-04 07:49:14,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:49:14,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:49:14,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:14,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897758149] [2025-03-04 07:49:14,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897758149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 07:49:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415318467] [2025-03-04 07:49:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:49:14,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:49:14,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:49:14,414 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,603 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-03-04 07:49:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-04 07:49:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,604 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:49:14,604 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:49:14,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:49:14,605 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 370 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:49:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-04 07:49:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.295774647887324) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2025-03-04 07:49:14,607 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 30 [2025-03-04 07:49:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,607 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2025-03-04 07:49:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2025-03-04 07:49:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:49:14,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,608 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, 1, 1] [2025-03-04 07:49:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:49:14,609 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:14,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1945657706, now seen corresponding path program 1 times [2025-03-04 07:49:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029497643] [2025-03-04 07:49:14,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:49:14,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:49:14,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,879 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:14,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029497643] [2025-03-04 07:49:14,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029497643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:14,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489914] [2025-03-04 07:49:14,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:14,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:14,881 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:14,883 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:14,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:49:14,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:49:14,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:49:14,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:14,975 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:15,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:15,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:15,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:15,055 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:15,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:15,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 07:49:15,129 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 30 treesize of output 13 [2025-03-04 07:49:15,142 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 31 treesize of output 13 [2025-03-04 07:49:15,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 07:49:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:15,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2025-03-04 07:49:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903990726] [2025-03-04 07:49:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:15,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:15,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:49:15,166 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,350 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2025-03-04 07:49:15,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:15,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-04 07:49:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,351 INFO L225 Difference]: With dead ends: 89 [2025-03-04 07:49:15,351 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:49:15,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:49:15,352 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 297 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:49:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 07:49:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2025-03-04 07:49:15,355 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2025-03-04 07:49:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2025-03-04 07:49:15,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2025-03-04 07:49:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:49:15,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,356 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,362 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:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:15,557 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:15,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2080511248, now seen corresponding path program 1 times [2025-03-04 07:49:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874201084] [2025-03-04 07:49:15,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:49:15,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:49:15,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874201084] [2025-03-04 07:49:15,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874201084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:15,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528919026] [2025-03-04 07:49:15,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:15,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:15,859 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:15,861 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:15,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:49:15,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:49:15,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 07:49:15,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:15,951 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:15,955 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:16,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:49:16,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:49:16,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:49:16,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:49:16,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-04 07:49:16,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:16,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-04 07:49:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:16,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:16,683 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 20 treesize of output 18 [2025-03-04 07:49:16,690 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 108 treesize of output 106 [2025-03-04 07:49:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:16,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528919026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:16,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:16,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 31 [2025-03-04 07:49:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024324530] [2025-03-04 07:49:16,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:49:16,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:49:16,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:49:16,699 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,154 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2025-03-04 07:49:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:49:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-04 07:49:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,155 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:49:17,155 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:49:17,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:49:17,156 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 683 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:49:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-03-04 07:49:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.308641975308642) internal successors, (106), 94 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-03-04 07:49:17,158 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 31 [2025-03-04 07:49:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,158 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-03-04 07:49:17,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-03-04 07:49:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:49:17,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,158 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:17,165 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:17,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,363 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:17,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash -71338559, now seen corresponding path program 1 times [2025-03-04 07:49:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788055473] [2025-03-04 07:49:17,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:17,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:17,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:17,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:17,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788055473] [2025-03-04 07:49:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788055473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:17,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969639114] [2025-03-04 07:49:17,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:17,487 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:17,489 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:17,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:17,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:17,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:49:17,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:17,604 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 13 treesize of output 9 [2025-03-04 07:49:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:17,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:17,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-03-04 07:49:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969639114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:17,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2025-03-04 07:49:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596816077] [2025-03-04 07:49:17,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:17,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:49:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:17,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:49:17,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:49:17,680 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,814 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2025-03-04 07:49:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:17,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 07:49:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,815 INFO L225 Difference]: With dead ends: 106 [2025-03-04 07:49:17,815 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:49:17,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:49:17,816 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 298 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:49:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 07:49:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2025-03-04 07:49:17,819 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2025-03-04 07:49:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,819 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2025-03-04 07:49:17,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2025-03-04 07:49:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:49:17,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,820 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, 1, 1, 1] [2025-03-04 07:49:17,830 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:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,024 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash 852193121, now seen corresponding path program 1 times [2025-03-04 07:49:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534989677] [2025-03-04 07:49:18,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:18,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:18,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:18,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:49:18,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:18,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534989677] [2025-03-04 07:49:18,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534989677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003128665] [2025-03-04 07:49:18,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:18,099 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:18,114 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:18,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:18,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:18,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:49:18,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:49:18,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:18,265 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:49:18,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:49:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:49:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003128665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:18,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:18,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-03-04 07:49:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164402180] [2025-03-04 07:49:18,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:18,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:18,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:18,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:18,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:18,279 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:18,341 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2025-03-04 07:49:18,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-04 07:49:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:18,341 INFO L225 Difference]: With dead ends: 98 [2025-03-04 07:49:18,341 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 07:49:18,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:18,343 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:18,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 183 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 07:49:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-04 07:49:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 92 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-03-04 07:49:18,345 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 40 [2025-03-04 07:49:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:18,345 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-03-04 07:49:18,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-03-04 07:49:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:49:18,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:18,345 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, 1, 1, 1] [2025-03-04 07:49:18,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:18,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,546 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:18,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 852193122, now seen corresponding path program 1 times [2025-03-04 07:49:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:18,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137923029] [2025-03-04 07:49:18,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:18,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:18,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:18,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,692 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:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137923029] [2025-03-04 07:49:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137923029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304056268] [2025-03-04 07:49:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:18,694 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:18,695 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:18,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:49:18,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:49:18,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:49:18,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:18,798 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,921 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:18,922 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,954 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:18,983 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 11 treesize of output 5 [2025-03-04 07:49:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:19,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304056268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:19,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2025-03-04 07:49:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418984429] [2025-03-04 07:49:19,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:49:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:49:19,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:49:19,243 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 18 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,484 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2025-03-04 07:49:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:19,485 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 18 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2025-03-04 07:49:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,485 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:49:19,485 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 07:49:19,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:49:19,486 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 464 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 07:49:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 07:49:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 92 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2025-03-04 07:49:19,489 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 40 [2025-03-04 07:49:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,489 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2025-03-04 07:49:19,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 18 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2025-03-04 07:49:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:19,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,489 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, 1, 1] [2025-03-04 07:49:19,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:19,690 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,SelfDestructingSolverStorable22 [2025-03-04 07:49:19,690 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:19,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash -91168834, now seen corresponding path program 1 times [2025-03-04 07:49:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562739137] [2025-03-04 07:49:19,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:19,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:19,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:49:20,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:20,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562739137] [2025-03-04 07:49:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562739137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:20,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063487250] [2025-03-04 07:49:20,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:20,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:20,018 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:20,020 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:20,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:20,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:20,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 07:49:20,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:20,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:20,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:20,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:20,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:20,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 07:49:20,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:20,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 07:49:20,305 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 31 treesize of output 13 [2025-03-04 07:49:20,314 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-03-04 07:49:20,325 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:20,326 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,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-03-04 07:49:20,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:20,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_936 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_936) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 07:49:20,457 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-04 07:49:20,457 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 33 treesize of output 32 [2025-03-04 07:49:20,462 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_935))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_936)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2025-03-04 07:49:20,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_935))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_936)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2025-03-04 07:49:20,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:20,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2025-03-04 07:49:20,481 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 162 treesize of output 126 [2025-03-04 07:49:20,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-04 07:49:20,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063487250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:20,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:20,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 14] total 31 [2025-03-04 07:49:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978016744] [2025-03-04 07:49:20,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:20,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:49:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:20,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:49:20,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=664, Unknown=17, NotChecked=220, Total=992 [2025-03-04 07:49:20,563 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 27 states have internal predecessors, (77), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:49:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:20,917 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2025-03-04 07:49:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 27 states have internal predecessors, (77), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2025-03-04 07:49:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:20,918 INFO L225 Difference]: With dead ends: 95 [2025-03-04 07:49:20,918 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 07:49:20,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=976, Unknown=19, NotChecked=268, Total=1406 [2025-03-04 07:49:20,918 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:20,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 604 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 462 Invalid, 0 Unknown, 160 Unchecked, 0.2s Time] [2025-03-04 07:49:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 07:49:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 07:49:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 90 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2025-03-04 07:49:20,922 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 42 [2025-03-04 07:49:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:20,922 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2025-03-04 07:49:20,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 27 states have internal predecessors, (77), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:49:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2025-03-04 07:49:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:20,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:20,923 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, 1, 1] [2025-03-04 07:49:20,930 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:21,124 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,SelfDestructingSolverStorable23 [2025-03-04 07:49:21,124 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -91168833, now seen corresponding path program 1 times [2025-03-04 07:49:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-03-04 07:49:21,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:21,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:21,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:21,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:21,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-03-04 07:49:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532172894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088201639] [2025-03-04 07:49:21,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:21,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:21,649 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:21,650 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:21,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:21,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:21,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:21,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:21,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 07:49:21,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:21,772 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,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:21,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:21,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:21,837 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:21,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:21,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 07:49:21,910 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 30 treesize of output 13 [2025-03-04 07:49:21,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:21,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 07:49:21,972 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 30 treesize of output 13 [2025-03-04 07:49:21,983 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 31 treesize of output 13 [2025-03-04 07:49:21,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 07:49:22,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#length| (store |c_old(#length)| alloc_and_zero_~pi~0.base 16))) is different from true [2025-03-04 07:49:22,048 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:22,049 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:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:22,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088201639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:22,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2025-03-04 07:49:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086980471] [2025-03-04 07:49:22,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:49:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:22,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:49:22,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=787, Unknown=1, NotChecked=56, Total=930 [2025-03-04 07:49:22,143 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 23 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:22,590 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2025-03-04 07:49:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:22,590 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 23 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2025-03-04 07:49:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:22,591 INFO L225 Difference]: With dead ends: 91 [2025-03-04 07:49:22,591 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 07:49:22,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1314, Unknown=1, NotChecked=74, Total=1560 [2025-03-04 07:49:22,591 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:22,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 629 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 529 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2025-03-04 07:49:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 07:49:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 07:49:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 86 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2025-03-04 07:49:22,595 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 42 [2025-03-04 07:49:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:22,595 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2025-03-04 07:49:22,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 23 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2025-03-04 07:49:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:49:22,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:22,596 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 07:49:22,605 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:22,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:49:22,797 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:22,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash -154165149, now seen corresponding path program 1 times [2025-03-04 07:49:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:22,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-03-04 07:49:22,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:22,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:49:22,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:49:22,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:22,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-03-04 07:49:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330616114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487387516] [2025-03-04 07:49:23,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:23,457 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:23,457 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:23,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:49:23,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:49:23,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:23,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:23,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 07:49:23,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:23,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:23,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:23,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:23,778 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:23,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-04 07:49:23,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:23,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 07:49:23,884 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 31 treesize of output 13 [2025-03-04 07:49:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:23,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:23,969 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-04 07:49:23,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:49:23,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1153) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) |c_ULTIMATE.start_create_#t~mem11#1.base|)) is different from false [2025-03-04 07:49:24,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1152))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_1153) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) .cse1)))) is different from false [2025-03-04 07:49:24,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:24,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2025-03-04 07:49:24,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:24,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 420 treesize of output 317 [2025-03-04 07:49:24,088 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 108 treesize of output 96 [2025-03-04 07:49:24,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:24,095 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 74 treesize of output 55 [2025-03-04 07:49:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487387516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:24,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:24,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2025-03-04 07:49:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587885377] [2025-03-04 07:49:24,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:24,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 07:49:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:24,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 07:49:24,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1333, Unknown=27, NotChecked=150, Total=1640 [2025-03-04 07:49:24,212 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 29 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:24,641 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2025-03-04 07:49:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:24,641 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 29 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2025-03-04 07:49:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:24,642 INFO L225 Difference]: With dead ends: 96 [2025-03-04 07:49:24,642 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 07:49:24,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=1861, Unknown=28, NotChecked=178, Total=2256 [2025-03-04 07:49:24,643 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:24,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 744 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 07:49:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-04 07:49:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 90 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-03-04 07:49:24,645 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 44 [2025-03-04 07:49:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:24,650 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-03-04 07:49:24,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 29 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-03-04 07:49:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:49:24,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:24,650 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 07:49:24,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:24,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:49:24,852 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:24,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash -154165148, now seen corresponding path program 1 times [2025-03-04 07:49:24,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:24,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-03-04 07:49:24,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:49:24,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:49:24,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:24,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-03-04 07:49:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863702791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531340806] [2025-03-04 07:49:25,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:25,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:25,513 INFO L229 MonitoredProcess]: Starting monitored process 13 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,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:49:25,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:49:25,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:49:25,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:25,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 07:49:25,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:25,734 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:25,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:25,761 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:25,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:25,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:25,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2025-03-04 07:49:25,846 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 30 treesize of output 13 [2025-03-04 07:49:25,900 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:25,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-03-04 07:49:25,904 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 49 treesize of output 30 [2025-03-04 07:49:26,021 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 39 treesize of output 21 [2025-03-04 07:49:26,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-04 07:49:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:26,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:26,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:26,236 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 48 treesize of output 52 [2025-03-04 07:49:26,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1251 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1251) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) (+ 5 |c_ULTIMATE.start_create_#t~mem11#1.offset|))) (forall ((v_ArrVal_1252 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem11#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1252) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))))) is different from false [2025-03-04 07:49:26,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1251 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1251) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) 5))) (forall ((v_ArrVal_1252 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1252) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) is different from false [2025-03-04 07:49:26,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1250))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1252) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1249) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1250) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_1251) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1249))) (< (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1250) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) (+ (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) 5)))))) is different from false [2025-03-04 07:49:26,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_1249))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_1250) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) 5)))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_1249) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_1250) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1251) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_1250))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse4 .cse5 v_ArrVal_1252) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) .cse5))))))) is different from false [2025-03-04 07:49:26,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:26,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2025-03-04 07:49:26,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:26,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 165 [2025-03-04 07:49:26,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:26,347 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 90 treesize of output 63 [2025-03-04 07:49:26,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2025-03-04 07:49:26,395 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-04 07:49:26,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 1 [2025-03-04 07:49:26,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:26,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-03-04 07:49:26,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:26,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-04 07:49:26,410 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:49:26,412 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 34 treesize of output 22 [2025-03-04 07:49:26,414 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:49:26,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:26,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 07:49:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531340806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:26,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2025-03-04 07:49:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805048908] [2025-03-04 07:49:26,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:26,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 07:49:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:26,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 07:49:26,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1436, Unknown=4, NotChecked=316, Total=1892 [2025-03-04 07:49:26,511 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 29 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:26,934 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-03-04 07:49:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:49:26,935 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 29 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2025-03-04 07:49:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:26,935 INFO L225 Difference]: With dead ends: 96 [2025-03-04 07:49:26,935 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 07:49:26,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=2059, Unknown=4, NotChecked=380, Total=2652 [2025-03-04 07:49:26,936 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 23 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:26,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 757 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 07:49:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-04 07:49:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2025-03-04 07:49:26,938 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 44 [2025-03-04 07:49:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:26,938 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2025-03-04 07:49:26,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 29 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2025-03-04 07:49:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:49:26,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:26,939 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:26,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:49:27,139 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash -484127474, now seen corresponding path program 1 times [2025-03-04 07:49:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621759583] [2025-03-04 07:49:27,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:27,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:49:27,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:49:27,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:27,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:49:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621759583] [2025-03-04 07:49:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621759583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895402622] [2025-03-04 07:49:27,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:27,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:27,207 INFO L229 MonitoredProcess]: Starting monitored process 14 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:27,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:49:27,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:49:27,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:49:27,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:27,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:27,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:49:27,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:49:27,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:27,351 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:49:27,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:49:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:49:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895402622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:27,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:27,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2025-03-04 07:49:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641770579] [2025-03-04 07:49:27,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:27,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:27,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:27,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:27,364 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:27,463 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2025-03-04 07:49:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:27,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-03-04 07:49:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:27,464 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:49:27,464 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 07:49:27,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:27,464 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:27,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 212 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 07:49:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-04 07:49:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2025-03-04 07:49:27,466 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 45 [2025-03-04 07:49:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:27,469 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2025-03-04 07:49:27,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2025-03-04 07:49:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:49:27,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:27,469 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:27,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:27,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 07:49:27,670 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash -484127473, now seen corresponding path program 1 times [2025-03-04 07:49:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639635936] [2025-03-04 07:49:27,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:27,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:49:27,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:49:27,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:27,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:49:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639635936] [2025-03-04 07:49:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639635936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877224757] [2025-03-04 07:49:27,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:27,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:27,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:27,791 INFO L229 MonitoredProcess]: Starting monitored process 15 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:27,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:49:27,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:49:27,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:49:27,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:27,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:27,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:49:27,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:28,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:28,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:28,223 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 19 [2025-03-04 07:49:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877224757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:28,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2025-03-04 07:49:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78496396] [2025-03-04 07:49:28,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:28,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:49:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:28,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:49:28,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:49:28,333 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:49:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:28,534 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-03-04 07:49:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:49:28,534 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45 [2025-03-04 07:49:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:28,534 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:49:28,534 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 07:49:28,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:49:28,535 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:28,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 514 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 07:49:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-04 07:49:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-03-04 07:49:28,542 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 45 [2025-03-04 07:49:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:28,542 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-03-04 07:49:28,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:49:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-03-04 07:49:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:49:28,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:28,542 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:28,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:28,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:28,743 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-04 07:49:28,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -881885083, now seen corresponding path program 2 times [2025-03-04 07:49:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479624873] [2025-03-04 07:49:28,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:28,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:49:28,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:49:28,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479624873] [2025-03-04 07:49:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479624873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893643004] [2025-03-04 07:49:29,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:29,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:29,624 INFO L229 MonitoredProcess]: Starting monitored process 16 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,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:49:29,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:49:29,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:49:29,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:29,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 07:49:29,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:29,763 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,858 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:29,860 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:29,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:29,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:29,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:49:29,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 07:49:29,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:29,973 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:49:29,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2025-03-04 07:49:29,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:29,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-03-04 07:49:30,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:30,046 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:49:30,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2025-03-04 07:49:30,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:30,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2025-03-04 07:49:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:30,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:30,449 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse1 (+ |c_ULTIMATE.start_create_#t~mem11#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1540 (Array Int Int))) (or (forall ((v_ArrVal_1541 (Array Int Int))) (or (not (= v_ArrVal_1541 (store .cse0 .cse1 (select v_ArrVal_1541 .cse1)))) (= (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1540))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1541) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse2 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) 0))) (not (= (store .cse4 .cse1 (select v_ArrVal_1540 .cse1)) v_ArrVal_1540)))) (forall ((v_ArrVal_1540 (Array Int Int))) (or (not (= (store .cse4 .cse1 (select v_ArrVal_1540 .cse1)) v_ArrVal_1540)) (forall ((v_ArrVal_1541 (Array Int Int))) (or (not (= v_ArrVal_1541 (store .cse0 .cse1 (select v_ArrVal_1541 .cse1)))) (= (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1541))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1540) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0))))))) is different from false [2025-03-04 07:49:30,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#0.offset| .cse2)) (.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| .cse0) (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse5 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12))) (or (forall ((v_ArrVal_1541 (Array Int Int))) (or (= (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1540))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1541) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse1 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) 0) (not (= (store .cse4 .cse5 (select v_ArrVal_1541 .cse5)) v_ArrVal_1541)))) (not (= v_ArrVal_1540 (store .cse6 .cse5 (select v_ArrVal_1540 .cse5))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int)) (or (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12))) (or (forall ((v_ArrVal_1541 (Array Int Int))) (or (= (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1541))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1540) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0) (not (= (store .cse4 .cse8 (select v_ArrVal_1541 .cse8)) v_ArrVal_1541)))) (not (= v_ArrVal_1540 (store .cse6 .cse8 (select v_ArrVal_1540 .cse8))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| .cse0))))))) is different from false [2025-03-04 07:49:30,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse8 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int) (v_ArrVal_1536 Int) (v_ArrVal_1537 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1537)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1536)))) (let ((.cse3 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= (store (select .cse0 .cse2) .cse3 (select v_ArrVal_1540 .cse3)) v_ArrVal_1540)) (forall ((v_ArrVal_1541 (Array Int Int))) (or (not (= v_ArrVal_1541 (store (select .cse4 .cse2) .cse3 (select v_ArrVal_1541 .cse3)))) (= (select (let ((.cse5 (store .cse4 .cse2 v_ArrVal_1541))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) (+ (select (select (store .cse0 .cse2 v_ArrVal_1540) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4)) 0)))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int) (v_ArrVal_1536 Int) (v_ArrVal_1537 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1537)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1536)))) (let ((.cse11 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12)) (.cse10 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= (store (select .cse9 .cse10) .cse11 (select v_ArrVal_1540 .cse11)) v_ArrVal_1540)) (forall ((v_ArrVal_1541 (Array Int Int))) (or (not (= v_ArrVal_1541 (store (select .cse12 .cse10) .cse11 (select v_ArrVal_1541 .cse11)))) (= (let ((.cse13 (store .cse9 .cse10 v_ArrVal_1540))) (select (select .cse13 (select (select (store .cse12 .cse10 v_ArrVal_1541) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)) (+ (select (select .cse13 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4))) 0)))))))))))) is different from false [2025-03-04 07:49:30,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse10 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse4 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$#0.offset| .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_31| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int) (v_ArrVal_1536 Int) (v_ArrVal_1537 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1537)))) (or (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1536)))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse2 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12))) (or (not (= v_ArrVal_1540 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1540 .cse2)))) (forall ((v_ArrVal_1541 (Array Int Int))) (or (= (select (let ((.cse3 (store .cse5 .cse1 v_ArrVal_1541))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4))) (+ (select (select (store .cse0 .cse1 v_ArrVal_1540) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4)) 0) (not (= v_ArrVal_1541 (store (select .cse5 .cse1) .cse2 (select v_ArrVal_1541 .cse2)))))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_31|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_31| Int)) (or (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_31|) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int) (v_ArrVal_1536 Int) (v_ArrVal_1537 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1537)))) (or (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1536)))) (let ((.cse13 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (not (= v_ArrVal_1540 (store (select .cse11 .cse12) .cse13 (select v_ArrVal_1540 .cse13)))) (forall ((v_ArrVal_1541 (Array Int Int))) (or (not (= v_ArrVal_1541 (store (select .cse14 .cse12) .cse13 (select v_ArrVal_1541 .cse13)))) (= (let ((.cse15 (store .cse11 .cse12 v_ArrVal_1540))) (select (select .cse15 (select (select (store .cse14 .cse12 v_ArrVal_1541) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4)) (+ (select (select .cse15 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4))) 0))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))))))))) is different from false [2025-03-04 07:49:30,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse5 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_31| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int) (v_ArrVal_1536 Int) (v_ArrVal_1537 Int)) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1537)))) (or (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1536)))) (let ((.cse2 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1540 .cse2)) v_ArrVal_1540)) (forall ((v_ArrVal_1541 (Array Int Int))) (or (not (= (store (select .cse3 .cse1) .cse2 (select v_ArrVal_1541 .cse2)) v_ArrVal_1541)) (= (select (let ((.cse4 (store .cse3 .cse1 v_ArrVal_1541))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5))) (+ (select (select (store .cse0 .cse1 v_ArrVal_1540) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4)) 0))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_31|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_31| Int)) (or (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_31|) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_32| Int) (v_ArrVal_1536 Int) (v_ArrVal_1537 Int)) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1537)))) (or (forall ((v_ArrVal_1540 (Array Int Int))) (let ((.cse14 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_31| v_ArrVal_1536)))) (let ((.cse13 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_32| 12)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (not (= (store (select .cse11 .cse12) .cse13 (select v_ArrVal_1540 .cse13)) v_ArrVal_1540)) (forall ((v_ArrVal_1541 (Array Int Int))) (or (not (= (store (select .cse14 .cse12) .cse13 (select v_ArrVal_1541 .cse13)) v_ArrVal_1541)) (= (let ((.cse15 (store .cse11 .cse12 v_ArrVal_1540))) (select (select .cse15 (select (select (store .cse14 .cse12 v_ArrVal_1541) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5)) (+ (select (select .cse15 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4))) 0))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_32| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))))))))) is different from false [2025-03-04 07:49:31,587 INFO L349 Elim1Store]: treesize reduction 1275, result has 38.3 percent of original size [2025-03-04 07:49:31,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 351728 treesize of output 325867 [2025-03-04 07:49:32,415 INFO L349 Elim1Store]: treesize reduction 291, result has 34.8 percent of original size [2025-03-04 07:49:32,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 37 case distinctions, treesize of input 2431632 treesize of output 1583351 [2025-03-04 07:49:37,469 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 1695 DAG size of output: 1136 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 07:49:38,374 INFO L349 Elim1Store]: treesize reduction 416, result has 31.1 percent of original size [2025-03-04 07:49:38,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 46 case distinctions, treesize of input 77511 treesize of output 53108 [2025-03-04 07:49:40,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:40,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 73243 treesize of output 52465 [2025-03-04 07:49:42,177 INFO L349 Elim1Store]: treesize reduction 758, result has 28.5 percent of original size [2025-03-04 07:49:42,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 51152 treesize of output 49463 [2025-03-04 07:49:44,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:44,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48687 treesize of output 48259