./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-lst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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-lst-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 31f7a9efc2cb78d8789da558d79970717791666cb2a6a53f6727ed996af2c74a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:08:20,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:08:20,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 12:08:20,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:08:20,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:08:20,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:08:20,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:08:20,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:08:20,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:08:20,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:08:20,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:08:20,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:08:20,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:08:20,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:08:20,490 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:08:20,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:08:20,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:08:20,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:08:20,490 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:08:20,490 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:08:20,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:08:20,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:20,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:08:20,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:08:20,492 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 -> 31f7a9efc2cb78d8789da558d79970717791666cb2a6a53f6727ed996af2c74a [2025-03-17 12:08:20,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:08:20,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:08:20,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:08:20,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:08:20,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:08:20,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-lst-data.i [2025-03-17 12:08:21,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e535de/fe7dee1d33d1485eaa3de3f8ecf2c26e/FLAGd0a4d881a [2025-03-17 12:08:22,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:08:22,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-lst-data.i [2025-03-17 12:08:22,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e535de/fe7dee1d33d1485eaa3de3f8ecf2c26e/FLAGd0a4d881a [2025-03-17 12:08:22,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e535de/fe7dee1d33d1485eaa3de3f8ecf2c26e [2025-03-17 12:08:22,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:08:22,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:08:22,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:22,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:08:22,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:08:22,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e44cc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22, skipping insertion in model container [2025-03-17 12:08:22,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:08:22,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:22,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:08:22,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:22,778 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:08:22,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22 WrapperNode [2025-03-17 12:08:22,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:22,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:22,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:08:22,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:08:22,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,810 INFO L138 Inliner]: procedures = 121, calls = 18, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 58 [2025-03-17 12:08:22,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:22,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:08:22,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:08:22,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:08:22,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,842 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-03-17 12:08:22,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:08:22,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:08:22,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:08:22,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:08:22,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:22,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:22,879 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-17 12:08:22,881 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-17 12:08:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:08:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-17 12:08:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-17 12:08:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:08:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:08:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:08:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:08:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:08:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:08:22,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:08:22,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:08:23,094 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-17 12:08:23,095 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:08:23,102 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:08:23,103 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:08:23,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:23 BoogieIcfgContainer [2025-03-17 12:08:23,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:08:23,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:08:23,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:08:23,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:08:23,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:08:22" (1/3) ... [2025-03-17 12:08:23,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3e125f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:23, skipping insertion in model container [2025-03-17 12:08:23,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (2/3) ... [2025-03-17 12:08:23,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3e125f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:23, skipping insertion in model container [2025-03-17 12:08:23,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:23" (3/3) ... [2025-03-17 12:08:23,111 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-lst-data.i [2025-03-17 12:08:23,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:08:23,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-lst-data.i that has 2 procedures, 54 locations, 1 initial locations, 3 loop locations, and 20 error locations. [2025-03-17 12:08:23,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:08:23,156 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;@6b19d533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:08:23,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-17 12:08:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 30 states have (on average 1.8) internal successors, (54), 50 states have internal predecessors, (54), 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-17 12:08:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:23,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:23,164 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 17 more)] === [2025-03-17 12:08:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2588099, now seen corresponding path program 1 times [2025-03-17 12:08:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454397440] [2025-03-17 12:08:23,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:23,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:23,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,337 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-17 12:08:23,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454397440] [2025-03-17 12:08:23,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454397440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857473014] [2025-03-17 12:08:23,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:23,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:23,363 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.8) internal successors, (54), 50 states have internal predecessors, (54), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 12:08:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,403 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-03-17 12:08:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:23,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2025-03-17 12:08:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,408 INFO L225 Difference]: With dead ends: 53 [2025-03-17 12:08:23,408 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 12:08:23,409 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-17 12:08:23,411 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 86 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 12:08:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 12:08:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 47 states have internal predecessors, (50), 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-17 12:08:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2025-03-17 12:08:23,434 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2025-03-17 12:08:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,435 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2025-03-17 12:08:23,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 12:08:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2025-03-17 12:08:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:23,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:23,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:08:23,436 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 17 more)] === [2025-03-17 12:08:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2588100, now seen corresponding path program 1 times [2025-03-17 12:08:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347642062] [2025-03-17 12:08:23,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:23,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:23,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,508 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-17 12:08:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347642062] [2025-03-17 12:08:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347642062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509335879] [2025-03-17 12:08:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:23,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:23,510 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 12:08:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,535 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-03-17 12:08:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2025-03-17 12:08:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,536 INFO L225 Difference]: With dead ends: 50 [2025-03-17 12:08:23,536 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 12:08:23,537 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-17 12:08:23,537 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 12:08:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 12:08:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 46 states have internal predecessors, (49), 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-17 12:08:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-03-17 12:08:23,541 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 4 [2025-03-17 12:08:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,541 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-03-17 12:08:23,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 12:08:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-03-17 12:08:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:08:23,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:23,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:08:23,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1727138478, now seen corresponding path program 1 times [2025-03-17 12:08:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530117804] [2025-03-17 12:08:23,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:08:23,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:08:23,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,682 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-17 12:08:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530117804] [2025-03-17 12:08:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530117804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:08:23,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848009141] [2025-03-17 12:08:23,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:23,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:23,684 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-17 12:08:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,760 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-17 12:08:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2025-03-17 12:08:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,762 INFO L225 Difference]: With dead ends: 51 [2025-03-17 12:08:23,762 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 12:08:23,763 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-17 12:08:23,763 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 129 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 12:08:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-17 12:08:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 43 states have internal predecessors, (46), 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-17 12:08:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2025-03-17 12:08:23,772 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2025-03-17 12:08:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,772 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2025-03-17 12:08:23,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-17 12:08:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2025-03-17 12:08:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:08:23,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:23,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:08:23,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1727138477, now seen corresponding path program 1 times [2025-03-17 12:08:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819328030] [2025-03-17 12:08:23,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:08:23,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:08:23,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,952 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-17 12:08:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819328030] [2025-03-17 12:08:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819328030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:08:23,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515284093] [2025-03-17 12:08:23,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:23,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:23,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:23,956 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-17 12:08:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,029 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-03-17 12:08:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:24,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2025-03-17 12:08:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,030 INFO L225 Difference]: With dead ends: 50 [2025-03-17 12:08:24,030 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 12:08:24,031 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-17 12:08:24,031 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 153 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 12:08:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-03-17 12:08:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 42 states have internal predecessors, (45), 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-17 12:08:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2025-03-17 12:08:24,035 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 9 [2025-03-17 12:08:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,036 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2025-03-17 12:08:24,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-17 12:08:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2025-03-17 12:08:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:08:24,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:08:24,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:24,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1130407162, now seen corresponding path program 1 times [2025-03-17 12:08:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250779353] [2025-03-17 12:08:24,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:08:24,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:08:24,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,146 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-17 12:08:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250779353] [2025-03-17 12:08:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250779353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004786820] [2025-03-17 12:08:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,148 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-17 12:08:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,235 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-03-17 12:08:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2025-03-17 12:08:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,236 INFO L225 Difference]: With dead ends: 52 [2025-03-17 12:08:24,236 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 12:08:24,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,238 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 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-17 12:08:24,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 12:08:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-17 12:08:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 47 states have internal predecessors, (53), 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-17 12:08:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-03-17 12:08:24,245 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 15 [2025-03-17 12:08:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,246 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-03-17 12:08:24,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-17 12:08:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-03-17 12:08:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:08:24,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:08:24,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1130407163, now seen corresponding path program 1 times [2025-03-17 12:08:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031604114] [2025-03-17 12:08:24,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:08:24,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:08:24,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,433 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-17 12:08:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031604114] [2025-03-17 12:08:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031604114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758588569] [2025-03-17 12:08:24,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:24,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,435 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-17 12:08:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,519 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-03-17 12:08:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2025-03-17 12:08:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,520 INFO L225 Difference]: With dead ends: 52 [2025-03-17 12:08:24,522 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 12:08:24,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,522 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 165 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 12:08:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-17 12:08:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 47 states have internal predecessors, (52), 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-17 12:08:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-17 12:08:24,527 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2025-03-17 12:08:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,527 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-17 12:08:24,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-17 12:08:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-17 12:08:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:08:24,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:08:24,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:24,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,529 INFO L85 PathProgramCache]: Analyzing trace with hash 682878742, now seen corresponding path program 1 times [2025-03-17 12:08:24,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155400874] [2025-03-17 12:08:24,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:08:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:08:24,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,590 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-17 12:08:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155400874] [2025-03-17 12:08:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155400874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554929827] [2025-03-17 12:08:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:24,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,592 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-17 12:08:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,621 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-03-17 12:08:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 16 [2025-03-17 12:08:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,622 INFO L225 Difference]: With dead ends: 53 [2025-03-17 12:08:24,622 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 12:08:24,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,623 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 229 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 12:08:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-17 12:08:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 48 states have internal predecessors, (52), 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-17 12:08:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-03-17 12:08:24,625 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2025-03-17 12:08:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,626 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-03-17 12:08:24,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-17 12:08:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-03-17 12:08:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:08:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:08:24,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1312795757, now seen corresponding path program 1 times [2025-03-17 12:08:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716081925] [2025-03-17 12:08:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:24,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:24,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716081925] [2025-03-17 12:08:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716081925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980823490] [2025-03-17 12:08:24,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:24,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:24,823 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-17 12:08:24,825 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-17 12:08:24,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:24,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:24,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 12:08:24,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:24,953 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-17 12:08:25,034 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:08:25,034 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-17 12:08:25,043 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-17 12:08:25,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:08:25,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980823490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:25,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:08:25,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-03-17 12:08:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020959629] [2025-03-17 12:08:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:25,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:08:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:25,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:08:25,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:08:25,044 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-17 12:08:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:25,089 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-03-17 12:08:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:08:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2025-03-17 12:08:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:25,093 INFO L225 Difference]: With dead ends: 54 [2025-03-17 12:08:25,093 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 12:08:25,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 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-17 12:08:25,094 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:25,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 66 Unchecked, 0.0s Time] [2025-03-17 12:08:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 12:08:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 12:08:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5) internal successors, (54), 49 states have internal predecessors, (54), 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-17 12:08:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-03-17 12:08:25,106 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 19 [2025-03-17 12:08:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:25,106 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-03-17 12:08:25,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-17 12:08:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-03-17 12:08:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:08:25,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:25,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:25,116 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-17 12:08:25,308 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-17 12:08:25,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:25,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:25,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1312795758, now seen corresponding path program 1 times [2025-03-17 12:08:25,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:25,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192174342] [2025-03-17 12:08:25,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:25,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:25,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:25,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:25,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:25,585 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-17 12:08:25,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:25,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192174342] [2025-03-17 12:08:25,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192174342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:25,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682143792] [2025-03-17 12:08:25,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:25,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:25,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:25,588 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-17 12:08:25,607 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-17 12:08:25,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:25,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:25,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:25,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:25,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 12:08:25,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:25,672 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-17 12:08:25,798 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-17 12:08:25,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:25,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:08:25,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:25,839 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-17 12:08:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:08:25,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682143792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:25,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2025-03-17 12:08:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388873545] [2025-03-17 12:08:25,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:08:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:25,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:08:25,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2025-03-17 12:08:25,946 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:08:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:26,137 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-03-17 12:08:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2025-03-17 12:08:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:26,138 INFO L225 Difference]: With dead ends: 62 [2025-03-17 12:08:26,138 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 12:08:26,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2025-03-17 12:08:26,139 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:26,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 270 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2025-03-17 12:08:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 12:08:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-03-17 12:08:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 55 states have internal predecessors, (61), 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-17 12:08:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2025-03-17 12:08:26,142 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 19 [2025-03-17 12:08:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:26,142 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2025-03-17 12:08:26,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:08:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2025-03-17 12:08:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:08:26,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:26,143 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:26,150 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-17 12:08:26,343 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-17 12:08:26,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -878813606, now seen corresponding path program 1 times [2025-03-17 12:08:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278243997] [2025-03-17 12:08:26,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:26,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:08:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:08:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:26,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278243997] [2025-03-17 12:08:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278243997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284549886] [2025-03-17 12:08:26,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:26,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:26,660 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-17 12:08:26,662 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-17 12:08:26,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:08:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:08:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:26,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:26,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 12:08:26,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:26,727 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-17 12:08:26,732 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-17 12:08:26,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:26,796 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-17 12:08:26,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:26,800 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-17 12:08:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:26,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:27,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284549886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:27,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:27,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 18 [2025-03-17 12:08:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607344234] [2025-03-17 12:08:27,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:27,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:08:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:27,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:08:27,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=248, Unknown=11, NotChecked=0, Total=306 [2025-03-17 12:08:27,149 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 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-17 12:08:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:27,283 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2025-03-17 12:08:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:27,285 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 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 18 [2025-03-17 12:08:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:27,286 INFO L225 Difference]: With dead ends: 62 [2025-03-17 12:08:27,286 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 12:08:27,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=248, Unknown=11, NotChecked=0, Total=306 [2025-03-17 12:08:27,286 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:27,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 370 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 12:08:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 12:08:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 57 states have internal predecessors, (63), 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-17 12:08:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2025-03-17 12:08:27,297 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2025-03-17 12:08:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:27,297 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2025-03-17 12:08:27,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 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-17 12:08:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2025-03-17 12:08:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:08:27,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:27,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:27,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:08:27,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:27,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:27,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1473422922, now seen corresponding path program 1 times [2025-03-17 12:08:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307560228] [2025-03-17 12:08:27,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:27,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:27,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:27,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:27,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:27,573 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-17 12:08:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307560228] [2025-03-17 12:08:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307560228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869643973] [2025-03-17 12:08:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:27,575 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-17 12:08:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:27,670 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2025-03-17 12:08:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2025-03-17 12:08:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:27,670 INFO L225 Difference]: With dead ends: 63 [2025-03-17 12:08:27,671 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 12:08:27,671 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-17 12:08:27,671 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:27,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 149 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 12:08:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 12:08:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.434782608695652) internal successors, (66), 58 states have internal predecessors, (66), 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-17 12:08:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2025-03-17 12:08:27,673 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 19 [2025-03-17 12:08:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:27,677 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2025-03-17 12:08:27,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-17 12:08:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2025-03-17 12:08:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:08:27,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:27,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:27,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:08:27,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:27,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1473422921, now seen corresponding path program 1 times [2025-03-17 12:08:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637539576] [2025-03-17 12:08:27,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:27,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:27,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:27,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:27,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:27,823 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-17 12:08:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637539576] [2025-03-17 12:08:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637539576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:27,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341267691] [2025-03-17 12:08:27,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:27,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:27,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:27,825 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-17 12:08:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:27,914 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-03-17 12:08:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:27,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2025-03-17 12:08:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:27,915 INFO L225 Difference]: With dead ends: 65 [2025-03-17 12:08:27,915 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 12:08:27,915 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-17 12:08:27,916 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:27,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 165 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 12:08:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 12:08:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 60 states have internal predecessors, (67), 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-17 12:08:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-03-17 12:08:27,922 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 19 [2025-03-17 12:08:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:27,922 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-03-17 12:08:27,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-17 12:08:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-03-17 12:08:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:08:27,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:27,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] [2025-03-17 12:08:27,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:08:27,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:27,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1473423273, now seen corresponding path program 1 times [2025-03-17 12:08:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:27,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763783020] [2025-03-17 12:08:27,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:27,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:27,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:27,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:27,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:27,984 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-17 12:08:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763783020] [2025-03-17 12:08:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763783020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:27,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:08:27,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461744966] [2025-03-17 12:08:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:27,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:27,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:27,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:27,988 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-17 12:08:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,029 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-03-17 12:08:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:28,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2025-03-17 12:08:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,029 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:08:28,029 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:08:28,030 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-17 12:08:28,030 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 238 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:08:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2025-03-17 12:08:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 61 states have internal predecessors, (67), 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-17 12:08:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2025-03-17 12:08:28,035 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2025-03-17 12:08:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,036 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2025-03-17 12:08:28,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-17 12:08:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2025-03-17 12:08:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:28,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:28,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:08:28,036 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:28,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1802642329, now seen corresponding path program 1 times [2025-03-17 12:08:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521961611] [2025-03-17 12:08:28,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:28,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:28,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,117 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-17 12:08:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521961611] [2025-03-17 12:08:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521961611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033983975] [2025-03-17 12:08:28,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:28,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:28,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:28,120 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-17 12:08:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,187 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2025-03-17 12:08:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 23 [2025-03-17 12:08:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,188 INFO L225 Difference]: With dead ends: 65 [2025-03-17 12:08:28,188 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 12:08:28,188 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-17 12:08:28,189 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 160 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 12:08:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 12:08:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 60 states have internal predecessors, (65), 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-17 12:08:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-03-17 12:08:28,195 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2025-03-17 12:08:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,196 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-03-17 12:08:28,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-17 12:08:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-03-17 12:08:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:28,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:28,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:08:28,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:28,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1802642328, now seen corresponding path program 1 times [2025-03-17 12:08:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130655545] [2025-03-17 12:08:28,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:28,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:28,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,348 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-17 12:08:28,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:28,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130655545] [2025-03-17 12:08:28,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130655545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:28,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:28,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465246754] [2025-03-17 12:08:28,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:28,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:28,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:28,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:28,350 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-17 12:08:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,411 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2025-03-17 12:08:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2025-03-17 12:08:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,413 INFO L225 Difference]: With dead ends: 64 [2025-03-17 12:08:28,413 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 12:08:28,413 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-17 12:08:28,413 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 12:08:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 12:08:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 59 states have internal predecessors, (63), 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-17 12:08:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2025-03-17 12:08:28,417 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 23 [2025-03-17 12:08:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,417 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2025-03-17 12:08:28,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-17 12:08:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2025-03-17 12:08:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:08:28,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,418 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] [2025-03-17 12:08:28,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:08:28,418 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:28,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash -176519143, now seen corresponding path program 1 times [2025-03-17 12:08:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745631936] [2025-03-17 12:08:28,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:08:28,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:08:28,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,485 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-17 12:08:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745631936] [2025-03-17 12:08:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745631936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131803099] [2025-03-17 12:08:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:28,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:28,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:28,487 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-17 12:08:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,542 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2025-03-17 12:08:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:28,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2025-03-17 12:08:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,543 INFO L225 Difference]: With dead ends: 69 [2025-03-17 12:08:28,543 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 12:08:28,543 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-17 12:08:28,544 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 202 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 12:08:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-17 12:08:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.320754716981132) internal successors, (70), 63 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-17 12:08:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2025-03-17 12:08:28,546 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 22 [2025-03-17 12:08:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,546 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2025-03-17 12:08:28,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-17 12:08:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2025-03-17 12:08:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:08:28,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,547 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] [2025-03-17 12:08:28,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:08:28,547 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:28,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1641839345, now seen corresponding path program 1 times [2025-03-17 12:08:28,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565891166] [2025-03-17 12:08:28,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:08:28,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:08:28,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,854 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-17 12:08:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565891166] [2025-03-17 12:08:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565891166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977568227] [2025-03-17 12:08:28,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:28,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:28,857 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-17 12:08:28,859 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-17 12:08:28,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:08:28,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:08:28,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 12:08:28,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:28,930 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-17 12:08:28,937 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-17 12:08:29,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:29,045 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-17 12:08:29,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:29,050 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-17 12:08:29,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:29,146 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-17 12:08:29,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:29,155 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-17 12:08:29,213 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-17 12:08:29,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:29,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 12:08:29,754 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 90 treesize of output 86 [2025-03-17 12:08:29,772 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-17 12:08:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977568227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:29,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:29,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-17 12:08:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617696596] [2025-03-17 12:08:29,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 12:08:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 12:08:29,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=619, Unknown=20, NotChecked=0, Total=702 [2025-03-17 12:08:29,774 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 24 states have internal predecessors, (45), 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-17 12:08:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:30,362 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-03-17 12:08:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 12:08:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 24 states have internal predecessors, (45), 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 25 [2025-03-17 12:08:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:30,363 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:08:30,363 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:08:30,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=1121, Unknown=29, NotChecked=0, Total=1260 [2025-03-17 12:08:30,364 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:30,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 484 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:08:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:08:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-17 12:08:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.360655737704918) internal successors, (83), 71 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-17 12:08:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-03-17 12:08:30,366 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 25 [2025-03-17 12:08:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:30,367 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-03-17 12:08:30,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 24 states have internal predecessors, (45), 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-17 12:08:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-03-17 12:08:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:08:30,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:30,367 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-17 12:08:30,375 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-17 12:08:30,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:08:30,568 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:30,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1641839696, now seen corresponding path program 1 times [2025-03-17 12:08:30,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:30,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293358290] [2025-03-17 12:08:30,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:30,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:08:30,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:08:30,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,709 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-17 12:08:30,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:30,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293358290] [2025-03-17 12:08:30,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293358290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:30,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709607167] [2025-03-17 12:08:30,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:30,712 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-17 12:08:30,715 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-17 12:08:30,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:08:30,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:08:30,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 12:08:30,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:30,831 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-17 12:08:30,850 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-17 12:08:30,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:30,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_19| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_19|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_19| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-03-17 12:08:30,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709607167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:30,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:30,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2025-03-17 12:08:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349582943] [2025-03-17 12:08:30,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:30,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:08:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:30,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:08:30,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:08:30,903 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) 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-17 12:08:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:31,061 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2025-03-17 12:08:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) 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 25 [2025-03-17 12:08:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:31,062 INFO L225 Difference]: With dead ends: 82 [2025-03-17 12:08:31,062 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 12:08:31,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:08:31,063 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:31,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 216 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 12:08:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 12:08:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 64 states have internal predecessors, (75), 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-17 12:08:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2025-03-17 12:08:31,065 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 25 [2025-03-17 12:08:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:31,065 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2025-03-17 12:08:31,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) 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-17 12:08:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2025-03-17 12:08:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:08:31,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:31,065 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] [2025-03-17 12:08:31,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:08:31,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 12:08:31,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:31,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash 676916193, now seen corresponding path program 1 times [2025-03-17 12:08:31,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:31,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520075624] [2025-03-17 12:08:31,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:31,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:08:31,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:08:31,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,330 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-17 12:08:31,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:31,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520075624] [2025-03-17 12:08:31,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520075624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:31,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320502958] [2025-03-17 12:08:31,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:31,334 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-17 12:08:31,335 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-17 12:08:31,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:08:31,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:08:31,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:08:31,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:31,430 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-17 12:08:31,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:31,452 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:08:31,453 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-17 12:08:31,466 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-17 12:08:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320502958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:31,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:31,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-17 12:08:31,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230605151] [2025-03-17 12:08:31,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:31,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:31,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:31,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:31,468 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-17 12:08:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:31,517 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-03-17 12:08:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:31,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 31 [2025-03-17 12:08:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:31,518 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:08:31,518 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:08:31,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:31,518 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:31,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:08:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-17 12:08:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 70 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-17 12:08:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-03-17 12:08:31,523 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 31 [2025-03-17 12:08:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:31,523 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-03-17 12:08:31,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-17 12:08:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-03-17 12:08:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:08:31,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:31,524 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] [2025-03-17 12:08:31,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:31,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:31,725 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash 676916194, now seen corresponding path program 1 times [2025-03-17 12:08:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028278655] [2025-03-17 12:08:31,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:31,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:08:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:08:31,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,855 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-17 12:08:31,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028278655] [2025-03-17 12:08:31,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028278655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:31,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128045604] [2025-03-17 12:08:31,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:31,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:31,858 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-17 12:08:31,859 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-17 12:08:31,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:08:31,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:08:31,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:08:31,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:32,066 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-17 12:08:32,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:32,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:32,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:08:32,235 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-17 12:08:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128045604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:32,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:32,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-03-17 12:08:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625632023] [2025-03-17 12:08:32,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:32,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 12:08:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:32,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 12:08:32,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:08:32,237 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 18 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:08:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:32,343 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2025-03-17 12:08:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:08:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 18 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2025-03-17 12:08:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:32,345 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:08:32,345 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:08:32,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:08:32,345 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:32,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:08:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-17 12:08:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 70 states have internal predecessors, (82), 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-17 12:08:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-03-17 12:08:32,349 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 31 [2025-03-17 12:08:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:32,349 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-03-17 12:08:32,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 18 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:08:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-03-17 12:08:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:32,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:32,354 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] [2025-03-17 12:08:32,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:08:32,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:32,555 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:32,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash -564385836, now seen corresponding path program 1 times [2025-03-17 12:08:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:32,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546580862] [2025-03-17 12:08:32,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:32,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:32,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:32,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:32,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:32,878 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-17 12:08:32,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546580862] [2025-03-17 12:08:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546580862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66953580] [2025-03-17 12:08:32,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:32,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:32,881 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-17 12:08:32,883 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-17 12:08:32,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:32,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:32,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:32,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:32,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:08:32,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:32,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:32,995 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-17 12:08:33,014 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-17 12:08:33,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:33,063 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-17 12:08:33,073 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-17 12:08:33,083 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-17 12:08:33,111 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:08:33,111 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-17 12:08:33,113 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-17 12:08:33,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:33,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66953580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:33,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:33,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 22 [2025-03-17 12:08:33,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236792081] [2025-03-17 12:08:33,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:33,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 12:08:33,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:33,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 12:08:33,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2025-03-17 12:08:33,154 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:08:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:33,378 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2025-03-17 12:08:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:08:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 35 [2025-03-17 12:08:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:33,379 INFO L225 Difference]: With dead ends: 74 [2025-03-17 12:08:33,379 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 12:08:33,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=662, Unknown=1, NotChecked=52, Total=812 [2025-03-17 12:08:33,380 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:33,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 315 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2025-03-17 12:08:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 12:08:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 12:08:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.35) internal successors, (81), 69 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-17 12:08:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2025-03-17 12:08:33,384 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 35 [2025-03-17 12:08:33,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:33,384 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2025-03-17 12:08:33,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:08:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2025-03-17 12:08:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:33,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:33,385 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] [2025-03-17 12:08:33,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:08:33,585 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,SelfDestructingSolverStorable20 [2025-03-17 12:08:33,586 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:33,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:33,586 INFO L85 PathProgramCache]: Analyzing trace with hash -564385835, now seen corresponding path program 1 times [2025-03-17 12:08:33,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:33,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505483902] [2025-03-17 12:08:33,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:33,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505483902] [2025-03-17 12:08:34,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505483902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265380446] [2025-03-17 12:08:34,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:34,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:34,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:34,075 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-17 12:08:34,076 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-17 12:08:34,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:34,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:34,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 12:08:34,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:34,196 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-17 12:08:34,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:34,234 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-17 12:08:34,260 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-17 12:08:34,263 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-17 12:08:34,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:34,342 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 73 treesize of output 66 [2025-03-17 12:08:34,346 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-17 12:08:34,386 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 42 treesize of output 18 [2025-03-17 12:08:34,391 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-17 12:08:34,466 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-17 12:08:34,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:34,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:08:34,491 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:34,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:08:34,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:34,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265380446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:34,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:34,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 28 [2025-03-17 12:08:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801239560] [2025-03-17 12:08:34,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:34,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:08:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:34,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:08:34,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=785, Unknown=1, NotChecked=56, Total=930 [2025-03-17 12:08:34,593 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:08:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:35,050 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2025-03-17 12:08:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:08:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2025-03-17 12:08:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:35,054 INFO L225 Difference]: With dead ends: 71 [2025-03-17 12:08:35,054 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 12:08:35,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1306, Unknown=1, NotChecked=74, Total=1560 [2025-03-17 12:08:35,056 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 14 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:35,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 437 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2025-03-17 12:08:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 12:08:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 12:08:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.3) internal successors, (78), 66 states have internal predecessors, (78), 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-17 12:08:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2025-03-17 12:08:35,058 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 35 [2025-03-17 12:08:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:35,059 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-17 12:08:35,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:08:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2025-03-17 12:08:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:08:35,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:35,059 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 12:08:35,068 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-17 12:08:35,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:35,263 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:35,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1138842131, now seen corresponding path program 1 times [2025-03-17 12:08:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39087601] [2025-03-17 12:08:35,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:08:35,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:08:35,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:35,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:35,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39087601] [2025-03-17 12:08:35,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39087601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:35,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78928330] [2025-03-17 12:08:35,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:35,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:35,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:35,746 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-17 12:08:35,748 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-17 12:08:35,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:08:35,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:08:35,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:35,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:35,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 12:08:35,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:35,951 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:08:35,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:08:35,987 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-17 12:08:36,080 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:36,080 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-17 12:08:36,164 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-17 12:08:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:36,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:36,325 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_767) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) 1)) is different from false [2025-03-17 12:08:36,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:36,332 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 24 treesize of output 25 [2025-03-17 12:08:36,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:36,337 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 40 treesize of output 39 [2025-03-17 12:08:36,350 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 9 treesize of output 5 [2025-03-17 12:08:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78928330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:36,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2025-03-17 12:08:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292329852] [2025-03-17 12:08:36,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:08:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:36,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:08:36,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1007, Unknown=10, NotChecked=64, Total=1190 [2025-03-17 12:08:36,522 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 25 states have internal predecessors, (59), 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-17 12:08:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:36,875 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2025-03-17 12:08:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:08:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 25 states have internal predecessors, (59), 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 34 [2025-03-17 12:08:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:36,876 INFO L225 Difference]: With dead ends: 75 [2025-03-17 12:08:36,876 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 12:08:36,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1536, Unknown=10, NotChecked=80, Total=1806 [2025-03-17 12:08:36,876 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:36,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 408 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 12:08:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-17 12:08:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 69 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-17 12:08:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-03-17 12:08:36,878 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 34 [2025-03-17 12:08:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:36,880 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-03-17 12:08:36,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 25 states have internal predecessors, (59), 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-17 12:08:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-03-17 12:08:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:08:36,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:36,881 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 12:08:36,888 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-17 12:08:37,085 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,SelfDestructingSolverStorable22 [2025-03-17 12:08:37,085 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:37,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1138842132, now seen corresponding path program 1 times [2025-03-17 12:08:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:37,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132500403] [2025-03-17 12:08:37,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:37,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:08:37,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:08:37,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:37,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:37,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132500403] [2025-03-17 12:08:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132500403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254181363] [2025-03-17 12:08:37,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:37,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:37,700 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-17 12:08:37,701 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-17 12:08:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:08:37,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:08:37,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:37,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:37,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 12:08:37,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:37,795 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-17 12:08:37,874 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-17 12:08:37,924 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:37,924 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-17 12:08:37,959 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-17 12:08:37,962 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-17 12:08:38,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:38,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:08:38,050 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-17 12:08:38,150 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-17 12:08:38,153 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-17 12:08:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:38,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:38,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_841 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_842) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_841) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))) (forall ((v_ArrVal_842 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_842) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))))) is different from false [2025-03-17 12:08:38,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_842 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_842) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_841 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_842) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_841) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) is different from false [2025-03-17 12:08:38,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:38,375 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 24 treesize of output 25 [2025-03-17 12:08:38,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:38,381 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 40 treesize of output 39 [2025-03-17 12:08:38,384 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 9 treesize of output 5 [2025-03-17 12:08:38,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:38,395 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 45 treesize of output 46 [2025-03-17 12:08:38,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:38,400 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 35 treesize of output 36 [2025-03-17 12:08:38,404 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:38,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:38,406 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 33 treesize of output 21 [2025-03-17 12:08:38,408 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:38,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:38,413 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 24 treesize of output 12 [2025-03-17 12:08:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254181363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:38,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:38,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2025-03-17 12:08:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972846927] [2025-03-17 12:08:38,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:38,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 12:08:38,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:38,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 12:08:38,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1225, Unknown=2, NotChecked=142, Total=1482 [2025-03-17 12:08:38,509 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 26 states have internal predecessors, (59), 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-17 12:08:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:38,903 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2025-03-17 12:08:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:08:38,904 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 26 states have internal predecessors, (59), 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 34 [2025-03-17 12:08:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:38,905 INFO L225 Difference]: With dead ends: 75 [2025-03-17 12:08:38,905 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 12:08:38,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=1648, Unknown=2, NotChecked=166, Total=1980 [2025-03-17 12:08:38,906 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:38,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 12:08:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-17 12:08:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 69 states have internal predecessors, (82), 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-17 12:08:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-03-17 12:08:38,912 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 34 [2025-03-17 12:08:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:38,912 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-03-17 12:08:38,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 26 states have internal predecessors, (59), 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-17 12:08:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2025-03-17 12:08:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:38,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:38,914 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] [2025-03-17 12:08:38,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 12:08:39,115 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,SelfDestructingSolverStorable23 [2025-03-17 12:08:39,115 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash 944362781, now seen corresponding path program 1 times [2025-03-17 12:08:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902717674] [2025-03-17 12:08:39,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:39,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:39,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:39,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:39,201 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-17 12:08:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902717674] [2025-03-17 12:08:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902717674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382023860] [2025-03-17 12:08:39,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:39,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:39,204 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-17 12:08:39,206 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-17 12:08:39,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:39,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:39,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:39,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:39,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:08:39,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:39,342 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-17 12:08:39,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:39,369 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:08:39,369 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-17 12:08:39,389 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-17 12:08:39,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382023860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:39,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:39,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-03-17 12:08:39,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821983987] [2025-03-17 12:08:39,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:39,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:39,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:39,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:39,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:39,390 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-17 12:08:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:39,444 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2025-03-17 12:08:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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 35 [2025-03-17 12:08:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:39,445 INFO L225 Difference]: With dead ends: 84 [2025-03-17 12:08:39,445 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 12:08:39,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 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-17 12:08:39,446 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:39,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 12:08:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-03-17 12:08:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 76 states have internal predecessors, (94), 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-17 12:08:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2025-03-17 12:08:39,448 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 35 [2025-03-17 12:08:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2025-03-17 12:08:39,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-17 12:08:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2025-03-17 12:08:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:39,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:39,448 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] [2025-03-17 12:08:39,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:08:39,649 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,SelfDestructingSolverStorable24 [2025-03-17 12:08:39,649 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:39,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash 944362782, now seen corresponding path program 1 times [2025-03-17 12:08:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:39,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327486947] [2025-03-17 12:08:39,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:39,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:39,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:39,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:39,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:39,766 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-17 12:08:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327486947] [2025-03-17 12:08:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327486947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102135621] [2025-03-17 12:08:39,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:39,769 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-17 12:08:39,770 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-17 12:08:39,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:39,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:39,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:39,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:39,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 12:08:39,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:39,870 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-17 12:08:39,971 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-17 12:08:39,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:39,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:08:39,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:39,992 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-17 12:08:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:08:40,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102135621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:40,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 19 [2025-03-17 12:08:40,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11289181] [2025-03-17 12:08:40,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:40,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:08:40,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:40,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:08:40,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=492, Unknown=1, NotChecked=44, Total=600 [2025-03-17 12:08:40,256 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 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-17 12:08:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:40,511 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-03-17 12:08:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:08:40,512 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 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 35 [2025-03-17 12:08:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:40,513 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:08:40,513 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:08:40,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=937, Unknown=1, NotChecked=62, Total=1122 [2025-03-17 12:08:40,513 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:40,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 327 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 394 Invalid, 0 Unknown, 82 Unchecked, 0.1s Time] [2025-03-17 12:08:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:08:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-03-17 12:08:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 89 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:08:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2025-03-17 12:08:40,516 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 35 [2025-03-17 12:08:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:40,516 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2025-03-17 12:08:40,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 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-17 12:08:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2025-03-17 12:08:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:08:40,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:40,516 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:40,523 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-17 12:08:40,716 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,SelfDestructingSolverStorable25 [2025-03-17 12:08:40,717 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-17 12:08:40,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1299244705, now seen corresponding path program 2 times [2025-03-17 12:08:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955836735] [2025-03-17 12:08:40,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:08:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:40,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 12:08:40,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:08:40,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:08:40,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:41,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955836735] [2025-03-17 12:08:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955836735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883323612] [2025-03-17 12:08:41,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:08:41,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:41,651 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-17 12:08:41,652 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-17 12:08:41,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 12:08:41,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:08:41,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:08:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 12:08:41,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:41,747 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-17 12:08:41,924 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-17 12:08:41,927 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-17 12:08:42,008 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:42,008 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-17 12:08:42,051 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 26 [2025-03-17 12:08:42,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 33 treesize of output 17 [2025-03-17 12:08:42,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:42,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:42,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:42,195 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:08:42,196 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 103 treesize of output 60 [2025-03-17 12:08:42,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:42,208 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 56 treesize of output 29 [2025-03-17 12:08:42,587 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:42,588 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:42,589 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:42,594 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2025-03-17 12:08:42,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 42 [2025-03-17 12:08:42,600 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:42,603 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:08:42,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2025-03-17 12:08:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:42,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:42,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |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|) .cse7))) (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| .cse2)) (.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1063 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| (select v_ArrVal_1063 |v_ULTIMATE.start_create_#t~mem8#1.offset_31|)) v_ArrVal_1063)) (forall ((v_ArrVal_1061 Int)) (= (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse2 (store .cse4 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| v_ArrVal_1061)))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1063) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse1 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) 0)))) (< .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_31|))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1063 (Array Int Int))) (or (forall ((v_ArrVal_1061 Int)) (= (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1063))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse2 (store .cse4 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| v_ArrVal_1061)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0)) (not (= (store .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| (select v_ArrVal_1063 |v_ULTIMATE.start_create_#t~mem8#1.offset_31|)) v_ArrVal_1063)))) (< .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_31|))))))) is different from false [2025-03-17 12:08:42,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (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|) .cse7 |c_ULTIMATE.start_create_#t~ret7#1.base|))) (.cse4 (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|) .cse7 |c_ULTIMATE.start_create_#t~ret7#1.offset|)))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse5 (select .cse4 |c_ULTIMATE.start_create_#t~ret7#1.base|)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_#t~ret7#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1063 (Array Int Int))) (or (not (= v_ArrVal_1063 (store .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| (select v_ArrVal_1063 |v_ULTIMATE.start_create_#t~mem8#1.offset_31|)))) (forall ((v_ArrVal_1061 Int)) (= (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_create_#t~ret7#1.base| v_ArrVal_1063))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (+ (select (select (store .cse4 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| v_ArrVal_1061)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4)) 0)))) (< |c_ULTIMATE.start_create_#t~ret7#1.offset| |v_ULTIMATE.start_create_#t~mem8#1.offset_31|))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_31| Int)) (or (< |c_ULTIMATE.start_create_#t~ret7#1.offset| |v_ULTIMATE.start_create_#t~mem8#1.offset_31|) (forall ((v_ArrVal_1063 (Array Int Int))) (or (forall ((v_ArrVal_1061 Int)) (= (let ((.cse6 (store .cse4 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| v_ArrVal_1061)))) (select (select .cse6 (select (select (store .cse3 |c_ULTIMATE.start_create_#t~ret7#1.base| v_ArrVal_1063) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)) (+ (select (select .cse6 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) 0)) (not (= v_ArrVal_1063 (store .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_31| (select v_ArrVal_1063 |v_ULTIMATE.start_create_#t~mem8#1.offset_31|)))))))))))) is different from false [2025-03-17 12:08:43,871 INFO L349 Elim1Store]: treesize reduction 826, result has 48.1 percent of original size [2025-03-17 12:08:43,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 4088 treesize of output 3510 [2025-03-17 12:08:45,986 INFO L349 Elim1Store]: treesize reduction 1623, result has 45.6 percent of original size [2025-03-17 12:08:45,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 68 case distinctions, treesize of input 13908 treesize of output 12550 [2025-03-17 12:08:47,181 INFO L349 Elim1Store]: treesize reduction 380, result has 41.0 percent of original size [2025-03-17 12:08:47,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 3498 treesize of output 3288 [2025-03-17 12:08:47,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:47,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3150 treesize of output 3161 [2025-03-17 12:08:47,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:47,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 6653 treesize of output 6419