./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-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-?-798a7b3-m [2025-03-04 07:49:05,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:49:05,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:49:05,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:49:05,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:49:05,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:49:05,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:49:05,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:49:05,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:49:05,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:49:05,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:49:05,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:49:05,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:49:05,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:49:05,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:49:05,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:49:05,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:49:05,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:49:05,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:49:05,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:05,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:49:05,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:49:05,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:49:05,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:49:05,417 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-04 07:49:05,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:49:05,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:49:05,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:49:05,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:49:05,648 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:49:05,649 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-04 07:49:06,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3857c8d88/46c4561ddb3e40eba3fb56985bd60153/FLAGe1013b167 [2025-03-04 07:49:07,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:49:07,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-lst-data.i [2025-03-04 07:49:07,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3857c8d88/46c4561ddb3e40eba3fb56985bd60153/FLAGe1013b167 [2025-03-04 07:49:07,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3857c8d88/46c4561ddb3e40eba3fb56985bd60153 [2025-03-04 07:49:07,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:49:07,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:49:07,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:07,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:49:07,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:49:07,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2dd7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07, skipping insertion in model container [2025-03-04 07:49:07,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:49:07,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:07,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:49:07,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:07,599 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:49:07,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07 WrapperNode [2025-03-04 07:49:07,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:07,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:07,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:49:07,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:49:07,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,628 INFO L138 Inliner]: procedures = 121, calls = 18, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 58 [2025-03-04 07:49:07,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:07,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:49:07,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:49:07,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:49:07,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,648 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-04 07:49:07,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:49:07,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:49:07,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:49:07,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:49:07,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (1/1) ... [2025-03-04 07:49:07,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:07,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:49:07,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:49:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:49:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-04 07:49:07,695 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-04 07:49:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:49:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:49:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:49:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:49:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:49:07,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:49:07,769 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:49:07,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:49:07,963 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-04 07:49:07,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:49:07,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:49:07,975 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:49:07,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:07 BoogieIcfgContainer [2025-03-04 07:49:07,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:49:07,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:49:07,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:49:07,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:49:07,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:49:07" (1/3) ... [2025-03-04 07:49:07,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da0be81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:07, skipping insertion in model container [2025-03-04 07:49:07,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:07" (2/3) ... [2025-03-04 07:49:07,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da0be81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:07, skipping insertion in model container [2025-03-04 07:49:07,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:07" (3/3) ... [2025-03-04 07:49:07,985 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-lst-data.i [2025-03-04 07:49:07,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:49:07,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-lst-data.i that has 2 procedures, 59 locations, 1 initial locations, 3 loop locations, and 20 error locations. [2025-03-04 07:49:08,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:49:08,032 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;@3e9a8604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:49:08,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 07:49:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:08,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:08,041 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-04 07:49:08,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 86813983, now seen corresponding path program 1 times [2025-03-04 07:49:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867689436] [2025-03-04 07:49:08,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:08,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:08,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867689436] [2025-03-04 07:49:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867689436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977228083] [2025-03-04 07:49:08,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:08,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:08,233 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:49:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:08,283 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-04 07:49:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:49:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:08,289 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:49:08,289 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 07:49:08,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:08,294 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:08,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 07:49:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 07:49:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-03-04 07:49:08,320 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 5 [2025-03-04 07:49:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-03-04 07:49:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:49:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-03-04 07:49:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:08,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:08,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:49:08,321 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-04 07:49:08,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash 86813984, now seen corresponding path program 1 times [2025-03-04 07:49:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316538246] [2025-03-04 07:49:08,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:08,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:08,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316538246] [2025-03-04 07:49:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316538246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840852153] [2025-03-04 07:49:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:08,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:08,410 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:49:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:08,437 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-03-04 07:49:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:08,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:49:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:08,438 INFO L225 Difference]: With dead ends: 55 [2025-03-04 07:49:08,438 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 07:49:08,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:08,439 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 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-04 07:49:08,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 07:49:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 07:49:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 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-04 07:49:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-03-04 07:49:08,444 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 5 [2025-03-04 07:49:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:08,445 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-03-04 07:49:08,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:49:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-03-04 07:49:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:49:08,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:08,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:49:08,446 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-04 07:49:08,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1075045763, now seen corresponding path program 1 times [2025-03-04 07:49:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823973467] [2025-03-04 07:49:08,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:49:08,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:49:08,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823973467] [2025-03-04 07:49:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823973467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980744614] [2025-03-04 07:49:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:08,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:08,557 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:08,643 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-03-04 07:49:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:49:08,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-04 07:49:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:08,645 INFO L225 Difference]: With dead ends: 57 [2025-03-04 07:49:08,645 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 07:49:08,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:08,646 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:08,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 07:49:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-03-04 07:49:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.5) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-03-04 07:49:08,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 10 [2025-03-04 07:49:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:08,651 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-03-04 07:49:08,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-03-04 07:49:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:49:08,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:08,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:49:08,651 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-04 07:49:08,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1075045762, now seen corresponding path program 1 times [2025-03-04 07:49:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118856710] [2025-03-04 07:49:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:49:08,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:49:08,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:08,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118856710] [2025-03-04 07:49:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118856710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083343410] [2025-03-04 07:49:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:08,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:08,775 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:08,834 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-04 07:49:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:49:08,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-04 07:49:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:08,835 INFO L225 Difference]: With dead ends: 56 [2025-03-04 07:49:08,835 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 07:49:08,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:08,836 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:08,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 07:49:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2025-03-04 07:49:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.4705882352941178) 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-04 07:49:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2025-03-04 07:49:08,843 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 10 [2025-03-04 07:49:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:08,843 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2025-03-04 07:49:08,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2025-03-04 07:49:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:49:08,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:08,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:49:08,845 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-04 07:49:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -646740445, now seen corresponding path program 1 times [2025-03-04 07:49:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033374453] [2025-03-04 07:49:08,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:08,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:49:08,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:49:08,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:08,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033374453] [2025-03-04 07:49:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033374453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:08,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:08,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:49:08,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32538809] [2025-03-04 07:49:08,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:08,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:08,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:08,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:08,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:08,954 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:09,058 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-03-04 07:49:09,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 18 [2025-03-04 07:49:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:09,059 INFO L225 Difference]: With dead ends: 59 [2025-03-04 07:49:09,060 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 07:49:09,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:09,061 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:09,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 07:49:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-04 07:49:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-03-04 07:49:09,068 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 18 [2025-03-04 07:49:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:09,069 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-03-04 07:49:09,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-03-04 07:49:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:49:09,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:09,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:09,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:49:09,070 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-04 07:49:09,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash -646740444, now seen corresponding path program 1 times [2025-03-04 07:49:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010400527] [2025-03-04 07:49:09,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:09,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:49:09,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:49:09,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:09,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:09,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010400527] [2025-03-04 07:49:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010400527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:09,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:49:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502251115] [2025-03-04 07:49:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:09,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:09,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:09,297 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:09,383 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-03-04 07:49:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 18 [2025-03-04 07:49:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:09,383 INFO L225 Difference]: With dead ends: 59 [2025-03-04 07:49:09,384 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 07:49:09,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:09,384 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:09,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 217 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 07:49:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-04 07:49:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-03-04 07:49:09,387 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 18 [2025-03-04 07:49:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:09,387 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-03-04 07:49:09,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-03-04 07:49:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:49:09,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:09,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:09,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:49:09,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:09,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash 482575737, now seen corresponding path program 1 times [2025-03-04 07:49:09,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:09,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215389912] [2025-03-04 07:49:09,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:09,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:09,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:09,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:09,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215389912] [2025-03-04 07:49:09,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215389912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955131321] [2025-03-04 07:49:09,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:09,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:09,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:09,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:09,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:49:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:09,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:09,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:09,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:09,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:49:09,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:09,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:49:09,919 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-04 07:49:09,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:09,945 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-04 07:49:09,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:09,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:09,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955131321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:10,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:10,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2025-03-04 07:49:10,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080387705] [2025-03-04 07:49:10,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:10,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:49:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:10,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:49:10,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2025-03-04 07:49:10,066 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 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-04 07:49:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:10,284 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-03-04 07:49:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:10,285 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 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 20 [2025-03-04 07:49:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:10,285 INFO L225 Difference]: With dead ends: 68 [2025-03-04 07:49:10,285 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 07:49:10,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=287, Unknown=1, NotChecked=34, Total=380 [2025-03-04 07:49:10,286 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:10,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 355 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 67 Unchecked, 0.2s Time] [2025-03-04 07:49:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 07:49:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-03-04 07:49:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 61 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-04 07:49:10,291 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 20 [2025-03-04 07:49:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:10,291 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-04 07:49:10,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 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-04 07:49:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-04 07:49:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:49:10,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:10,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:10,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:49:10,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:10,492 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-04 07:49:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash 482575736, now seen corresponding path program 1 times [2025-03-04 07:49:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008672812] [2025-03-04 07:49:10,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:10,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:10,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:10,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:10,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008672812] [2025-03-04 07:49:10,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008672812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70566628] [2025-03-04 07:49:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:10,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:10,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:49:10,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:10,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:10,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:10,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:49:10,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:10,715 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-03-04 07:49:10,739 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:49:10,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:49:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:10,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70566628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-03-04 07:49:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273577041] [2025-03-04 07:49:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:10,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:49:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:10,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:49:10,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:49:10,744 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:10,775 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-03-04 07:49:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:49:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2025-03-04 07:49:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:10,776 INFO L225 Difference]: With dead ends: 66 [2025-03-04 07:49:10,777 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 07:49:10,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:49:10,777 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:10,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 71 Unchecked, 0.0s Time] [2025-03-04 07:49:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 07:49:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 07:49:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 61 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-03-04 07:49:10,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 20 [2025-03-04 07:49:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:10,780 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-03-04 07:49:10,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-03-04 07:49:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:49:10,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:10,781 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-04 07:49:10,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:10,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 07:49:10,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:10,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1425907534, now seen corresponding path program 1 times [2025-03-04 07:49:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:10,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540728165] [2025-03-04 07:49:10,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:10,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:49:10,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:49:10,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540728165] [2025-03-04 07:49:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540728165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:11,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532952764] [2025-03-04 07:49:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:11,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:11,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:11,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:11,051 INFO L87 Difference]: Start difference. First operand 66 states and 74 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-04 07:49:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:11,084 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-03-04 07:49:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:11,085 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-04 07:49:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:11,085 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:49:11,085 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:49:11,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:11,086 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:11,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 298 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:49:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-04 07:49:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-03-04 07:49:11,089 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2025-03-04 07:49:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:11,089 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-03-04 07:49:11,089 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-04 07:49:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-03-04 07:49:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:49:11,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:11,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:11,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:49:11,090 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-04 07:49:11,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1244300837, now seen corresponding path program 1 times [2025-03-04 07:49:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:11,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247027670] [2025-03-04 07:49:11,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:11,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:49:11,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:49:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247027670] [2025-03-04 07:49:11,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247027670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037999371] [2025-03-04 07:49:11,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:11,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:11,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:49:11,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:49:11,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:49:11,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 07:49:11,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:11,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:49:11,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:49:11,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:11,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:49:11,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:11,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:49:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037999371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:11,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:11,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2025-03-04 07:49:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748319421] [2025-03-04 07:49:11,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:11,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:49:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:11,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:49:11,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=280, Unknown=15, NotChecked=0, Total=342 [2025-03-04 07:49:11,868 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:12,050 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2025-03-04 07:49:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 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 22 [2025-03-04 07:49:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:12,051 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:49:12,051 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:49:12,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=310, Unknown=16, NotChecked=0, Total=380 [2025-03-04 07:49:12,051 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:12,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 540 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:49:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 07:49:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 64 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-03-04 07:49:12,055 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 22 [2025-03-04 07:49:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:12,055 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-03-04 07:49:12,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-03-04 07:49:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:49:12,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:12,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:12,063 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-04 07:49:12,256 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-04 07:49:12,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:12,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:12,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1545275762, now seen corresponding path program 1 times [2025-03-04 07:49:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256901145] [2025-03-04 07:49:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:49:12,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:49:12,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:12,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:12,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:12,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256901145] [2025-03-04 07:49:12,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256901145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:12,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:12,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:12,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368724324] [2025-03-04 07:49:12,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:12,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:12,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:12,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:12,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:12,351 INFO L87 Difference]: Start difference. First operand 69 states and 76 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-04 07:49:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:12,421 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-03-04 07:49:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:12,421 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 24 [2025-03-04 07:49:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:12,422 INFO L225 Difference]: With dead ends: 68 [2025-03-04 07:49:12,422 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 07:49:12,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:12,422 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:12,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 07:49:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-04 07:49:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-03-04 07:49:12,429 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 24 [2025-03-04 07:49:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:12,429 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-03-04 07:49:12,429 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-04 07:49:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-03-04 07:49:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:49:12,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:12,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:12,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:49:12,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:12,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1545275763, now seen corresponding path program 1 times [2025-03-04 07:49:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:12,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848913893] [2025-03-04 07:49:12,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:12,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:49:12,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:49:12,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:12,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:12,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:12,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848913893] [2025-03-04 07:49:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848913893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:12,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339451733] [2025-03-04 07:49:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:12,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:12,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:12,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:12,600 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:12,673 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2025-03-04 07:49:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:12,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 24 [2025-03-04 07:49:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:12,674 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:49:12,674 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:49:12,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:12,674 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 204 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:12,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 204 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:49:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 07:49:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 62 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-04 07:49:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2025-03-04 07:49:12,677 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 24 [2025-03-04 07:49:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:12,677 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2025-03-04 07:49:12,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:49:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2025-03-04 07:49:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:49:12,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:12,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, 1, 1, 1, 1] [2025-03-04 07:49:12,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:49:12,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:12,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash -81354868, now seen corresponding path program 1 times [2025-03-04 07:49:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:12,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777986428] [2025-03-04 07:49:12,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:12,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:12,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:49:12,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:49:12,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:12,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:12,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:12,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777986428] [2025-03-04 07:49:12,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777986428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:12,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:12,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696267665] [2025-03-04 07:49:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:12,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:12,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:12,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:12,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:12,762 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:12,868 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2025-03-04 07:49:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:12,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2025-03-04 07:49:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:12,870 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:49:12,870 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:49:12,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:12,871 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:12,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:49:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 07:49:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 64 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-03-04 07:49:12,875 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 23 [2025-03-04 07:49:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:12,875 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-03-04 07:49:12,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-03-04 07:49:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:49:12,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:12,876 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] [2025-03-04 07:49:12,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:49:12,876 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:12,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -81354867, now seen corresponding path program 1 times [2025-03-04 07:49:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319287168] [2025-03-04 07:49:12,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:12,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:49:12,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:49:12,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:13,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319287168] [2025-03-04 07:49:13,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319287168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:13,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083190476] [2025-03-04 07:49:13,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:13,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,030 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,122 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-03-04 07:49:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2025-03-04 07:49:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,123 INFO L225 Difference]: With dead ends: 71 [2025-03-04 07:49:13,123 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 07:49:13,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,124 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 209 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 07:49:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 07:49:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2025-03-04 07:49:13,126 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 23 [2025-03-04 07:49:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,126 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2025-03-04 07:49:13,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2025-03-04 07:49:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:49:13,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,127 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] [2025-03-04 07:49:13,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:49:13,127 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:13,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1772967077, now seen corresponding path program 1 times [2025-03-04 07:49:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576275340] [2025-03-04 07:49:13,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:49:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:49:13,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:13,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576275340] [2025-03-04 07:49:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576275340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260729919] [2025-03-04 07:49:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:13,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,185 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,231 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-03-04 07:49:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:13,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 24 [2025-03-04 07:49:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,233 INFO L225 Difference]: With dead ends: 78 [2025-03-04 07:49:13,233 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 07:49:13,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,234 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 291 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 07:49:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-03-04 07:49:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-03-04 07:49:13,237 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 24 [2025-03-04 07:49:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-03-04 07:49:13,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-03-04 07:49:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:13,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:13,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:49:13,239 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-04 07:49:13,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1281331612, now seen corresponding path program 1 times [2025-03-04 07:49:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266024773] [2025-03-04 07:49:13,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:13,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:13,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:13,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266024773] [2025-03-04 07:49:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266024773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:13,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191304770] [2025-03-04 07:49:13,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:13,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:13,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,323 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,386 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-03-04 07:49:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 07:49:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,387 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:49:13,387 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 07:49:13,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:13,388 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 259 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 07:49:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-03-04 07:49:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.278688524590164) internal successors, (78), 71 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-04 07:49:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2025-03-04 07:49:13,390 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2025-03-04 07:49:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,390 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2025-03-04 07:49:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2025-03-04 07:49:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:49:13,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,392 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:13,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:49:13,392 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-04 07:49:13,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1519254213, now seen corresponding path program 1 times [2025-03-04 07:49:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840686109] [2025-03-04 07:49:13,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:13,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:13,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840686109] [2025-03-04 07:49:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840686109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658940391] [2025-03-04 07:49:13,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:13,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:13,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:49:13,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:13,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:13,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:49:13,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:13,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:13,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:13,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:13,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:49:13,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:13,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:49:14,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:14,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-04 07:49:14,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:14,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-04 07:49:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:14,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:14,624 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-04 07:49:14,628 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-04 07:49:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:14,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658940391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:14,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:14,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2025-03-04 07:49:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669250617] [2025-03-04 07:49:14,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:49:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:49:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=777, Unknown=23, NotChecked=0, Total=870 [2025-03-04 07:49:14,644 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,209 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2025-03-04 07:49:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:49:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 27 states have internal predecessors, (52), 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 29 [2025-03-04 07:49:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,210 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:49:15,210 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:49:15,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=1403, Unknown=33, NotChecked=0, Total=1560 [2025-03-04 07:49:15,211 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 614 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:49:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:49:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-03-04 07:49:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 81 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2025-03-04 07:49:15,216 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 29 [2025-03-04 07:49:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2025-03-04 07:49:15,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:49:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2025-03-04 07:49:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:49:15,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:15,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:15,422 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-04 07:49:15,422 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-04 07:49:15,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash -147758964, now seen corresponding path program 1 times [2025-03-04 07:49:15,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394927430] [2025-03-04 07:49:15,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:49:15,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:49:15,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394927430] [2025-03-04 07:49:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394927430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777654104] [2025-03-04 07:49:15,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:15,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:15,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:15,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:49:15,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:49:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:49:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:49:15,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:15,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:49:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:15,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:15,711 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-04 07:49:15,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777654104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:15,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:15,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2025-03-04 07:49:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671381284] [2025-03-04 07:49:15,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:49:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:49:15,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:49:15,713 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,828 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-03-04 07:49:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 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 30 [2025-03-04 07:49:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,829 INFO L225 Difference]: With dead ends: 93 [2025-03-04 07:49:15,829 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:49:15,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:49:15,830 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 246 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:49:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 07:49:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 71 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-04 07:49:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2025-03-04 07:49:15,832 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 30 [2025-03-04 07:49:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,832 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-03-04 07:49:15,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2025-03-04 07:49:15,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:49:15,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,833 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] [2025-03-04 07:49:15,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:16,037 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-04 07:49:16,037 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-04 07:49:16,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1961738538, now seen corresponding path program 1 times [2025-03-04 07:49:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326426673] [2025-03-04 07:49:16,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:49:16,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:49:16,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:49:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326426673] [2025-03-04 07:49:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326426673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582488047] [2025-03-04 07:49:16,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:16,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:16,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:16,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:49:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:49:16,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:49:16,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:49:16,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:49:16,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:16,216 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:49:16,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:49:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:49:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582488047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:16,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:16,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-03-04 07:49:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036981121] [2025-03-04 07:49:16,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:16,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:16,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:16,232 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,285 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2025-03-04 07:49:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:16,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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 34 [2025-03-04 07:49:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,286 INFO L225 Difference]: With dead ends: 85 [2025-03-04 07:49:16,286 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 07:49:16,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:16,287 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 07:49:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-04 07:49:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 79 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-03-04 07:49:16,289 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 34 [2025-03-04 07:49:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:16,290 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-03-04 07:49:16,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-03-04 07:49:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:49:16,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,290 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] [2025-03-04 07:49:16,296 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-04 07:49:16,490 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-04 07:49:16,491 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-04 07:49:16,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1961738539, now seen corresponding path program 1 times [2025-03-04 07:49:16,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344761994] [2025-03-04 07:49:16,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:49:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:49:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344761994] [2025-03-04 07:49:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344761994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221324411] [2025-03-04 07:49:16,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:16,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:49:16,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:49:16,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:49:16,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 07:49:16,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:16,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:49:16,823 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-04 07:49:16,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:16,845 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-04 07:49:16,852 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:16,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:16,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221324411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:17,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:17,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2025-03-04 07:49:17,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452183796] [2025-03-04 07:49:17,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:17,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:49:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:17,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:49:17,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:49:17,020 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,197 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2025-03-04 07:49:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:17,197 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 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-04 07:49:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,198 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:49:17,198 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:49:17,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=438, Unknown=1, NotChecked=42, Total=552 [2025-03-04 07:49:17,199 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 334 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2025-03-04 07:49:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:49:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2025-03-04 07:49:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 94 states have internal predecessors, (112), 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-04 07:49:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2025-03-04 07:49:17,203 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 34 [2025-03-04 07:49:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,203 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2025-03-04 07:49:17,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2025-03-04 07:49:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:49:17,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:17,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:17,404 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-04 07:49:17,405 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:17,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1030022464, now seen corresponding path program 1 times [2025-03-04 07:49:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280695060] [2025-03-04 07:49:17,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:17,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:17,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:17,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:17,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280695060] [2025-03-04 07:49:17,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280695060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:17,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049880981] [2025-03-04 07:49:17,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:17,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:17,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:49:17,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:17,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:17,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 07:49:17,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:17,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:49:17,964 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:17,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:17,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:49:17,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:18,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:18,066 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-04 07:49:18,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 07:49:18,110 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-04 07:49:18,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 07:49:18,197 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-04 07:49:18,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:18,233 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-04 07:49:18,238 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:18,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:18,259 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-04 07:49:18,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049880981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2025-03-04 07:49:18,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174313929] [2025-03-04 07:49:18,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:18,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:49:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:18,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:49:18,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=794, Unknown=1, NotChecked=56, Total=930 [2025-03-04 07:49:18,354 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 22 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:18,795 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2025-03-04 07:49:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:18,795 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 22 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-04 07:49:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:18,796 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:49:18,796 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 07:49:18,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1463, Unknown=1, NotChecked=78, Total=1722 [2025-03-04 07:49:18,797 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:18,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 622 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 478 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2025-03-04 07:49:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 07:49:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 07:49:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 91 states have internal predecessors, (106), 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-04 07:49:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2025-03-04 07:49:18,799 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 36 [2025-03-04 07:49:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2025-03-04 07:49:18,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 22 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2025-03-04 07:49:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:49:18,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:18,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:18,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:19,000 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-04 07:49:19,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:19,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1030022465, now seen corresponding path program 1 times [2025-03-04 07:49:19,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452963479] [2025-03-04 07:49:19,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:19,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:49:19,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:19,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452963479] [2025-03-04 07:49:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452963479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738996315] [2025-03-04 07:49:19,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:19,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:19,297 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:19,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:49:19,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:19,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:19,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:49:19,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:19,421 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:19,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:19,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:19,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:19,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 07:49:19,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 07:49:19,507 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-03-04 07:49:19,531 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:49:19,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:49:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-03-04 07:49:19,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738996315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:19,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:19,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 22 [2025-03-04 07:49:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624057689] [2025-03-04 07:49:19,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:49:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:49:19,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2025-03-04 07:49:19,574 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 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-04 07:49:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,775 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-03-04 07:49:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:19,775 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 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 36 [2025-03-04 07:49:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,776 INFO L225 Difference]: With dead ends: 96 [2025-03-04 07:49:19,776 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 07:49:19,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 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-04 07:49:19,777 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 484 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2025-03-04 07:49:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 07:49:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 07:49:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 90 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-04 07:49:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2025-03-04 07:49:19,780 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 36 [2025-03-04 07:49:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,780 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2025-03-04 07:49:19,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 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-04 07:49:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2025-03-04 07:49:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:49:19,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:19,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:19,985 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-04 07:49:19,985 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-04 07:49:19,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -663624276, now seen corresponding path program 1 times [2025-03-04 07:49:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139399023] [2025-03-04 07:49:19,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:20,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:20,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139399023] [2025-03-04 07:49:20,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139399023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612645444] [2025-03-04 07:49:20,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:20,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:20,414 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:20,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:49:20,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:20,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:20,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:49:20,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:20,618 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:49:20,618 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-04 07:49:20,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:20,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:20,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 07:49:20,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 07:49:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:20,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:21,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:21,083 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-04 07:49:21,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:21,089 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-04 07:49:21,091 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-04 07:49:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612645444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:21,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2025-03-04 07:49:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642836511] [2025-03-04 07:49:21,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:49:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:49:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1335, Unknown=24, NotChecked=0, Total=1482 [2025-03-04 07:49:21,276 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 28 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:21,698 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2025-03-04 07:49:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:49:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 28 states have internal predecessors, (66), 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 38 [2025-03-04 07:49:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:21,698 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:49:21,698 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:49:21,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=1943, Unknown=26, NotChecked=0, Total=2162 [2025-03-04 07:49:21,699 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:21,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 544 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:49:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 07:49:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.25) internal successors, (110), 94 states have internal predecessors, (110), 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-04 07:49:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2025-03-04 07:49:21,701 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 38 [2025-03-04 07:49:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:21,701 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2025-03-04 07:49:21,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 28 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2025-03-04 07:49:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:49:21,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:21,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:21,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:21,906 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-04 07:49:21,906 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-04 07:49:21,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash -663624275, now seen corresponding path program 1 times [2025-03-04 07:49:21,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:21,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101100386] [2025-03-04 07:49:21,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:21,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:21,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:21,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:21,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:21,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101100386] [2025-03-04 07:49:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101100386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089839251] [2025-03-04 07:49:22,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:22,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:22,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:22,425 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:22,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:49:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:22,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:22,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:22,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:22,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 07:49:22,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:22,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:49:22,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:22,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:22,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:22,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:49:22,738 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 07:49:22,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 07:49:22,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 07:49:22,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 07:49:22,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 07:49:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:22,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:23,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_846) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_845) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))) (forall ((v_ArrVal_846 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_846) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))))) is different from false [2025-03-04 07:49:23,059 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_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_846) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))) (forall ((v_ArrVal_846 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_846) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))))) is different from false [2025-03-04 07:49:23,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:23,072 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-04 07:49:23,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:23,076 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-04 07:49:23,078 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-04 07:49:23,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:23,090 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-04 07:49:23,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:23,095 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-04 07:49:23,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:49:23,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:23,099 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-04 07:49:23,100 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:49:23,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:23,102 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-04 07:49:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089839251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:23,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2025-03-04 07:49:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259822479] [2025-03-04 07:49:23,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:49:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:23,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:49:23,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1289, Unknown=2, NotChecked=146, Total=1560 [2025-03-04 07:49:23,192 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:23,524 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2025-03-04 07:49:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:49:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 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 38 [2025-03-04 07:49:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:23,525 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:49:23,525 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:49:23,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1807, Unknown=2, NotChecked=174, Total=2162 [2025-03-04 07:49:23,526 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:23,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 562 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:49:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 07:49:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 94 states have internal predecessors, (109), 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-04 07:49:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2025-03-04 07:49:23,528 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 38 [2025-03-04 07:49:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:23,528 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2025-03-04 07:49:23,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2025-03-04 07:49:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:49:23,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:23,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:23,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:23,730 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-04 07:49:23,730 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-04 07:49:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 902508773, now seen corresponding path program 1 times [2025-03-04 07:49:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995143380] [2025-03-04 07:49:23,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:23,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:49:23,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:49:23,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:23,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:49:23,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995143380] [2025-03-04 07:49:23,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995143380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87533243] [2025-03-04 07:49:23,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:23,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:23,793 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:23,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:49:23,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:49:23,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:49:23,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:23,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:23,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-04 07:49:23,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:23,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:23,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:24,027 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 19 treesize of output 7 [2025-03-04 07:49:24,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:24,055 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2025-03-04 07:49:24,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-03-04 07:49:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:24,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:24,215 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:49:24,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:49:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:49:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87533243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:24,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 6] total 25 [2025-03-04 07:49:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234672226] [2025-03-04 07:49:24,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:24,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:49:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:24,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:49:24,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:49:24,267 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 23 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:49:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:24,615 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2025-03-04 07:49:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:49:24,616 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 23 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2025-03-04 07:49:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:24,617 INFO L225 Difference]: With dead ends: 111 [2025-03-04 07:49:24,617 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 07:49:24,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 07:49:24,617 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:24,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 500 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 07:49:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2025-03-04 07:49:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 101 states have internal predecessors, (118), 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-04 07:49:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2025-03-04 07:49:24,625 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 39 [2025-03-04 07:49:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:24,625 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2025-03-04 07:49:24,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 23 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:49:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2025-03-04 07:49:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:24,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:24,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:24,827 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-04 07:49:24,827 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 17 more)] === [2025-03-04 07:49:24,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash -596903634, now seen corresponding path program 2 times [2025-03-04 07:49:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297011033] [2025-03-04 07:49:24,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:24,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 07:49:24,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:24,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:24,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:25,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297011033] [2025-03-04 07:49:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297011033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478145787] [2025-03-04 07:49:25,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:25,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:25,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:25,590 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:25,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:49:25,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 07:49:25,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:25,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:25,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-04 07:49:25,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:25,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:49:25,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:25,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:25,815 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:25,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:25,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:49:25,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 07:49:25,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:25,923 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:49:25,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2025-03-04 07:49:25,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:25,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-03-04 07:49:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:26,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:26,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse5 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#0.offset| .cse3))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_27| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_27|) (forall ((v_ArrVal_997 (Array Int Int))) (or (forall ((v_ArrVal_996 Int)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_997))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse3 (store .cse4 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| v_ArrVal_996)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4)) 0)) (not (= v_ArrVal_997 (store .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| (select v_ArrVal_997 |v_ULTIMATE.start_create_#t~mem8#1.offset_27|)))))))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_27| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_27|) (forall ((v_ArrVal_997 (Array Int Int))) (or (not (= v_ArrVal_997 (store .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| (select v_ArrVal_997 |v_ULTIMATE.start_create_#t~mem8#1.offset_27|)))) (forall ((v_ArrVal_996 Int)) (= (let ((.cse6 (store |c_#memory_$Pointer$#0.offset| .cse3 (store .cse4 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| v_ArrVal_996)))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_997) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)) (+ (select (select .cse6 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) 0)))))))))) is different from false [2025-03-04 07:49:26,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.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|))) (.cse2 (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|)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_#t~ret7#1.base|)) (.cse5 (select .cse4 |c_ULTIMATE.start_create_#t~ret7#1.base|)) (.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_997 (Array Int Int))) (or (not (= v_ArrVal_997 (store .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| (select v_ArrVal_997 |v_ULTIMATE.start_create_#t~mem8#1.offset_27|)))) (forall ((v_ArrVal_996 Int)) (= 0 (let ((.cse1 (store .cse4 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| v_ArrVal_996)))) (select (select .cse1 (select (select (store .cse2 |c_ULTIMATE.start_create_#t~ret7#1.base| v_ArrVal_997) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse1 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))))))) (< |c_ULTIMATE.start_create_#t~ret7#1.offset| |v_ULTIMATE.start_create_#t~mem8#1.offset_27|))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_997 (Array Int Int))) (or (not (= v_ArrVal_997 (store .cse0 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| (select v_ArrVal_997 |v_ULTIMATE.start_create_#t~mem8#1.offset_27|)))) (forall ((v_ArrVal_996 Int)) (= (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_create_#t~ret7#1.base| v_ArrVal_997))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store .cse4 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse5 |v_ULTIMATE.start_create_#t~mem8#1.offset_27| v_ArrVal_996)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0)))) (< |c_ULTIMATE.start_create_#t~ret7#1.offset| |v_ULTIMATE.start_create_#t~mem8#1.offset_27|))))))) is different from false [2025-03-04 07:49:27,252 INFO L349 Elim1Store]: treesize reduction 1501, result has 47.6 percent of original size [2025-03-04 07:49:27,253 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 8 new quantified variables, introduced 17 case distinctions, treesize of input 5243 treesize of output 4998 [2025-03-04 07:49:27,697 INFO L349 Elim1Store]: treesize reduction 236, result has 39.3 percent of original size [2025-03-04 07:49:27,697 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 8 new quantified variables, introduced 23 case distinctions, treesize of input 5305 treesize of output 4735 [2025-03-04 07:49:29,435 INFO L349 Elim1Store]: treesize reduction 1524, result has 46.1 percent of original size [2025-03-04 07:49:29,436 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 15 new quantified variables, introduced 68 case distinctions, treesize of input 22656 treesize of output 12616 [2025-03-04 07:49:30,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:30,563 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 11379 treesize of output 11168 [2025-03-04 07:49:31,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:31,353 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 6613 treesize of output 6431