./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5f4313d2aac6b022567c009849c88733b705c81f514e2d4cf0f2f107f9f3584 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:16:49,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:16:49,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:16:49,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:16:49,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:16:49,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:16:49,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:16:49,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:16:49,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:16:49,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:16:49,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:16:49,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:16:49,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:16:49,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:16:49,213 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:16:49,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:16:49,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:16:49,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:16:49,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:16:49,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:49,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:49,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:49,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:16:49,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5f4313d2aac6b022567c009849c88733b705c81f514e2d4cf0f2f107f9f3584 [2025-04-29 11:16:49,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:16:49,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:16:49,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:16:49,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:16:49,441 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:16:49,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1-2.c [2025-04-29 11:16:50,696 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcf85971/cbdc4532f0154951906949d006046e87/FLAG710dada01 [2025-04-29 11:16:50,895 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:50,899 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/960521-1_1-2.c [2025-04-29 11:16:50,901 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:50,901 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:50,908 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcf85971/cbdc4532f0154951906949d006046e87/FLAG710dada01 [2025-04-29 11:16:51,747 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcf85971/cbdc4532f0154951906949d006046e87 [2025-04-29 11:16:51,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:16:51,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:16:51,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:51,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:16:51,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:16:51,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:51,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a280e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51, skipping insertion in model container [2025-04-29 11:16:51,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:51,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:16:51,904 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:51,910 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:16:51,937 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:51,947 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:16:51,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51 WrapperNode [2025-04-29 11:16:51,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:51,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:51,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:16:51,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:16:51,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:51,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:51,977 INFO L138 Inliner]: procedures = 11, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-04-29 11:16:51,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:51,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:16:51,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:16:51,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:16:51,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:51,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:51,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,001 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [1, 4]. 80 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2025-04-29 11:16:52,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:16:52,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:16:52,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:16:52,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:16:52,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (1/1) ... [2025-04-29 11:16:52,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:52,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:52,034 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-04-29 11:16:52,036 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-04-29 11:16:52,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:16:52,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:16:52,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:16:52,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:16:52,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:16:52,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:16:52,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:16:52,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:16:52,102 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:16:52,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:16:52,237 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-04-29 11:16:52,238 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:16:52,245 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:16:52,245 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:16:52,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:52 BoogieIcfgContainer [2025-04-29 11:16:52,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:16:52,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:16:52,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:16:52,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:16:52,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:16:51" (1/3) ... [2025-04-29 11:16:52,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a0a1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:52, skipping insertion in model container [2025-04-29 11:16:52,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:51" (2/3) ... [2025-04-29 11:16:52,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a0a1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:52, skipping insertion in model container [2025-04-29 11:16:52,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:52" (3/3) ... [2025-04-29 11:16:52,252 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1_1-2.c [2025-04-29 11:16:52,261 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:16:52,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1_1-2.c that has 1 procedures, 57 locations, 61 edges, 1 initial locations, 3 loop locations, and 23 error locations. [2025-04-29 11:16:52,286 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:16:52,294 INFO L340 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;@7e70a88c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:16:52,295 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-29 11:16:52,299 INFO L278 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:16:52,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:16:52,302 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:52,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash 28703694, now seen corresponding path program 1 times [2025-04-29 11:16:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522815248] [2025-04-29 11:16:52,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:16:52,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:16:52,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522815248] [2025-04-29 11:16:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522815248] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116099519] [2025-04-29 11:16:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:16:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:16:52,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:16:52,417 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,429 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-04-29 11:16:52,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:16:52,431 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:16:52,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,435 INFO L225 Difference]: With dead ends: 57 [2025-04-29 11:16:52,435 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:16:52,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:16:52,440 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:16:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-29 11:16:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.8125) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-04-29 11:16:52,464 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 5 [2025-04-29 11:16:52,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,465 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-04-29 11:16:52,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,465 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-04-29 11:16:52,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:16:52,465 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:16:52,466 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:52,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash 889540586, now seen corresponding path program 1 times [2025-04-29 11:16:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577050968] [2025-04-29 11:16:52,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:16:52,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:16:52,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577050968] [2025-04-29 11:16:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577050968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072380025] [2025-04-29 11:16:52,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:52,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:52,555 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,592 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2025-04-29 11:16:52,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:52,592 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:16:52,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,592 INFO L225 Difference]: With dead ends: 54 [2025-04-29 11:16:52,592 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:16:52,593 INFO L436 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-04-29 11:16:52,593 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:16:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 11:16:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2025-04-29 11:16:52,596 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 6 [2025-04-29 11:16:52,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,596 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2025-04-29 11:16:52,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,597 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2025-04-29 11:16:52,597 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:16:52,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:16:52,597 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:52,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash 889540587, now seen corresponding path program 1 times [2025-04-29 11:16:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712025295] [2025-04-29 11:16:52,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:16:52,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:16:52,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712025295] [2025-04-29 11:16:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712025295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:52,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737577035] [2025-04-29 11:16:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:52,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:52,729 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,804 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2025-04-29 11:16:52,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:52,805 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:16:52,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,806 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:16:52,806 INFO L226 Difference]: Without dead ends: 105 [2025-04-29 11:16:52,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:52,807 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-29 11:16:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 58. [2025-04-29 11:16:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-04-29 11:16:52,814 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 6 [2025-04-29 11:16:52,814 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,814 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-04-29 11:16:52,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,814 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-04-29 11:16:52,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:16:52,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,814 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:16:52,814 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:52,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 294052655, now seen corresponding path program 1 times [2025-04-29 11:16:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323343873] [2025-04-29 11:16:52,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:52,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:52,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323343873] [2025-04-29 11:16:52,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323343873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:52,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413436434] [2025-04-29 11:16:52,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:52,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:52,913 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-04-29 11:16:52,914 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-04-29 11:16:52,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:52,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:52,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:16:52,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:53,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-04-29 11:16:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413436434] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:53,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-29 11:16:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456888709] [2025-04-29 11:16:53,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:53,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:16:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:53,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:16:53,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:16:53,069 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:53,262 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2025-04-29 11:16:53,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:16:53,265 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:16:53,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:53,266 INFO L225 Difference]: With dead ends: 205 [2025-04-29 11:16:53,266 INFO L226 Difference]: Without dead ends: 205 [2025-04-29 11:16:53,266 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:16:53,267 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 255 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:53,267 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 435 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-29 11:16:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 53. [2025-04-29 11:16:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.75) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2025-04-29 11:16:53,274 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 9 [2025-04-29 11:16:53,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:53,274 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2025-04-29 11:16:53,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,274 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2025-04-29 11:16:53,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:16:53,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:53,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:53,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:16:53,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:53,475 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:53,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash 355372398, now seen corresponding path program 1 times [2025-04-29 11:16:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156076692] [2025-04-29 11:16:53,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:53,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:53,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:53,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156076692] [2025-04-29 11:16:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156076692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750249140] [2025-04-29 11:16:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:53,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:53,531 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:53,559 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-04-29 11:16:53,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:53,560 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:16:53,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:53,560 INFO L225 Difference]: With dead ends: 50 [2025-04-29 11:16:53,560 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:16:53,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:53,561 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:53,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 64 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:16:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-29 11:16:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.65625) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-04-29 11:16:53,563 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 9 [2025-04-29 11:16:53,563 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:53,563 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-04-29 11:16:53,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,563 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-04-29 11:16:53,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:16:53,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:53,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:53,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:16:53,563 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:53,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash 355372399, now seen corresponding path program 1 times [2025-04-29 11:16:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292771859] [2025-04-29 11:16:53,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:53,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:53,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:53,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292771859] [2025-04-29 11:16:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292771859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:53,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206802273] [2025-04-29 11:16:53,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:53,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:53,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:53,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:53,708 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:53,774 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-04-29 11:16:53,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:53,775 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:16:53,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:53,775 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:16:53,775 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:16:53,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:53,776 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:53,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 74 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:16:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-04-29 11:16:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-04-29 11:16:53,778 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 9 [2025-04-29 11:16:53,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:53,778 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-04-29 11:16:53,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,779 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-04-29 11:16:53,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:16:53,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:53,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:53,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:16:53,779 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:53,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1868351499, now seen corresponding path program 1 times [2025-04-29 11:16:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562554600] [2025-04-29 11:16:53,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:16:53,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:16:53,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:53,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562554600] [2025-04-29 11:16:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562554600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436422810] [2025-04-29 11:16:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:53,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:53,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:53,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:53,809 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:53,842 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2025-04-29 11:16:53,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:53,843 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:16:53,843 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:53,843 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:16:53,843 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:16:53,844 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:53,845 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:53,845 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 65 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:16:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-04-29 11:16:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-04-29 11:16:53,848 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 10 [2025-04-29 11:16:53,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:53,848 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-04-29 11:16:53,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:53,848 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-04-29 11:16:53,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:16:53,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:53,849 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:53,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:53,849 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:53,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash -195276941, now seen corresponding path program 1 times [2025-04-29 11:16:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851717179] [2025-04-29 11:16:53,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:16:53,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:16:53,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:53,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851717179] [2025-04-29 11:16:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851717179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:53,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860059892] [2025-04-29 11:16:53,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:53,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:53,921 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-04-29 11:16:53,922 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-04-29 11:16:53,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:16:53,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:16:53,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:16:53,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860059892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:54,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:16:54,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:16:54,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998386886] [2025-04-29 11:16:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:54,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:54,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:54,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:54,008 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:54,056 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-04-29 11:16:54,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:54,056 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:16:54,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:54,057 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:16:54,057 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:16:54,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:54,058 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 33 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:54,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:16:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 60. [2025-04-29 11:16:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-04-29 11:16:54,061 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 12 [2025-04-29 11:16:54,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:54,061 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-04-29 11:16:54,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,061 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-04-29 11:16:54,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:16:54,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:54,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:54,068 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-04-29 11:16:54,265 WARN L466 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-04-29 11:16:54,265 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:54,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1317613340, now seen corresponding path program 1 times [2025-04-29 11:16:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:54,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994774234] [2025-04-29 11:16:54,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:54,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:54,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:16:54,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:16:54,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:54,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:54,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:54,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994774234] [2025-04-29 11:16:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994774234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:54,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:54,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015022262] [2025-04-29 11:16:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:54,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:54,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:54,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:54,308 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:54,345 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2025-04-29 11:16:54,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:54,346 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:16:54,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:54,346 INFO L225 Difference]: With dead ends: 57 [2025-04-29 11:16:54,346 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:16:54,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:54,347 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:54,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:16:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-29 11:16:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-04-29 11:16:54,350 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2025-04-29 11:16:54,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:54,351 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-04-29 11:16:54,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,351 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-04-29 11:16:54,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:16:54,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:54,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:54,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:16:54,351 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:54,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:54,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1317613341, now seen corresponding path program 1 times [2025-04-29 11:16:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:54,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993870802] [2025-04-29 11:16:54,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:54,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:54,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:16:54,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:16:54,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:54,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:54,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993870802] [2025-04-29 11:16:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993870802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747059170] [2025-04-29 11:16:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:54,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:54,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:54,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:54,435 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:54,462 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2025-04-29 11:16:54,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:54,462 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:16:54,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:54,463 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:16:54,463 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:16:54,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:54,463 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:54,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 55 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:16:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 11:16:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-04-29 11:16:54,465 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2025-04-29 11:16:54,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:54,465 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-04-29 11:16:54,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,465 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-04-29 11:16:54,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:16:54,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:54,470 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:54,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:16:54,470 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:54,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash -313827401, now seen corresponding path program 1 times [2025-04-29 11:16:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:54,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502586201] [2025-04-29 11:16:54,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:54,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:54,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:54,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:54,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:54,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502586201] [2025-04-29 11:16:54,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502586201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:54,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072122682] [2025-04-29 11:16:54,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:54,703 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-04-29 11:16:54,704 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-04-29 11:16:54,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:54,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:54,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:54,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:16:54,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:54,775 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:16:54,775 INFO L354 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 1 case distinctions, treesize of input 9 treesize of output 11 [2025-04-29 11:16:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072122682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:55,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-04-29 11:16:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245503388] [2025-04-29 11:16:55,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:55,064 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:16:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:55,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:16:55,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:16:55,065 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:55,828 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2025-04-29 11:16:55,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:16:55,829 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:16:55,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:55,830 INFO L225 Difference]: With dead ends: 221 [2025-04-29 11:16:55,830 INFO L226 Difference]: Without dead ends: 221 [2025-04-29 11:16:55,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 11:16:55,831 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 461 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:55,831 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 524 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:16:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-04-29 11:16:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 94. [2025-04-29 11:16:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-04-29 11:16:55,834 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 15 [2025-04-29 11:16:55,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:55,835 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-04-29 11:16:55,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:55,835 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-04-29 11:16:55,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:16:55,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:55,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:55,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:56,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:56,040 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:56,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2103659402, now seen corresponding path program 1 times [2025-04-29 11:16:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:56,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102382944] [2025-04-29 11:16:56,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:56,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:56,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:56,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:56,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102382944] [2025-04-29 11:16:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102382944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992341421] [2025-04-29 11:16:56,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:56,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:56,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:56,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:56,144 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:56,229 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2025-04-29 11:16:56,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:56,229 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:16:56,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:56,230 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:16:56,230 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:16:56,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:56,231 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 77 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:56,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 102 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:16:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2025-04-29 11:16:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2025-04-29 11:16:56,234 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 15 [2025-04-29 11:16:56,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:56,234 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2025-04-29 11:16:56,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,234 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2025-04-29 11:16:56,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:16:56,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:56,235 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:56,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:16:56,235 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:56,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash 911669291, now seen corresponding path program 2 times [2025-04-29 11:16:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:56,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209800186] [2025-04-29 11:16:56,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:56,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-29 11:16:56,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:16:56,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:56,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:56,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209800186] [2025-04-29 11:16:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209800186] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:56,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510114156] [2025-04-29 11:16:56,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:56,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:56,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:56,285 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-04-29 11:16:56,288 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-04-29 11:16:56,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-29 11:16:56,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:16:56,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:56,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:16:56,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510114156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:56,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-04-29 11:16:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9718637] [2025-04-29 11:16:56,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:56,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:16:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:56,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:16:56,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:16:56,399 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:56,486 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2025-04-29 11:16:56,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:16:56,486 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:16:56,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:56,487 INFO L225 Difference]: With dead ends: 141 [2025-04-29 11:16:56,487 INFO L226 Difference]: Without dead ends: 141 [2025-04-29 11:16:56,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:56,488 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:56,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 128 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-29 11:16:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 102. [2025-04-29 11:16:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 92 states have (on average 1.25) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-04-29 11:16:56,492 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 18 [2025-04-29 11:16:56,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:56,492 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-04-29 11:16:56,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,493 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-04-29 11:16:56,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:16:56,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:56,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:56,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:16:56,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:56,695 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:56,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2045544271, now seen corresponding path program 1 times [2025-04-29 11:16:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:56,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247387327] [2025-04-29 11:16:56,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:56,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:56,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:16:56,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:16:56,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:56,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:56,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:56,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247387327] [2025-04-29 11:16:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247387327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:56,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426092728] [2025-04-29 11:16:56,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:56,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:56,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:56,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:56,718 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:56,728 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2025-04-29 11:16:56,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:56,728 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:16:56,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:56,728 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:16:56,728 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:16:56,729 INFO L436 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-04-29 11:16:56,729 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:56,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:16:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-29 11:16:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 99 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2025-04-29 11:16:56,731 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 18 [2025-04-29 11:16:56,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:56,731 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2025-04-29 11:16:56,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:56,732 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2025-04-29 11:16:56,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:16:56,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:56,732 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:56,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:16:56,732 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:56,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:56,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1966736142, now seen corresponding path program 1 times [2025-04-29 11:16:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:56,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851498756] [2025-04-29 11:16:56,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:56,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:56,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:16:56,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:16:56,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:56,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:16:56,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:56,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851498756] [2025-04-29 11:16:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851498756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:56,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266309704] [2025-04-29 11:16:56,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:56,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:56,770 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-04-29 11:16:56,771 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-04-29 11:16:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:16:56,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:16:56,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:56,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:16:56,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266309704] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:56,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:56,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-04-29 11:16:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667037738] [2025-04-29 11:16:56,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:56,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:56,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:56,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:56,890 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:57,055 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2025-04-29 11:16:57,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:16:57,055 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:16:57,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:57,056 INFO L225 Difference]: With dead ends: 149 [2025-04-29 11:16:57,056 INFO L226 Difference]: Without dead ends: 149 [2025-04-29 11:16:57,056 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:16:57,057 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 127 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:57,057 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 333 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-04-29 11:16:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2025-04-29 11:16:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.2) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2025-04-29 11:16:57,059 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 19 [2025-04-29 11:16:57,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:57,059 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2025-04-29 11:16:57,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:57,059 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2025-04-29 11:16:57,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:16:57,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:57,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:57,065 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-04-29 11:16:57,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:16:57,264 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:57,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1803017030, now seen corresponding path program 2 times [2025-04-29 11:16:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:57,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273242124] [2025-04-29 11:16:57,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:57,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-29 11:16:57,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:16:57,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:57,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:16:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:57,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273242124] [2025-04-29 11:16:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273242124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:57,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125172070] [2025-04-29 11:16:57,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:57,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:57,434 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-04-29 11:16:57,441 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-04-29 11:16:57,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-29 11:16:57,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:16:57,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:57,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:57,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:16:57,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:57,494 INFO L354 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 10 treesize of output 8 [2025-04-29 11:16:57,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-04-29 11:16:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:16:57,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:16:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125172070] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:16:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 17 [2025-04-29 11:16:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995373232] [2025-04-29 11:16:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:57,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:57,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:57,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:16:57,878 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:58,003 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2025-04-29 11:16:58,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:58,003 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:16:58,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:58,004 INFO L225 Difference]: With dead ends: 111 [2025-04-29 11:16:58,004 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 11:16:58,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:16:58,005 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 92 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:58,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 64 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 11:16:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2025-04-29 11:16:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-04-29 11:16:58,007 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2025-04-29 11:16:58,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:58,008 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-04-29 11:16:58,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:58,008 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-04-29 11:16:58,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:16:58,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:58,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:58,025 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-04-29 11:16:58,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:16:58,211 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:58,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1340334141, now seen corresponding path program 1 times [2025-04-29 11:16:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:58,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593083082] [2025-04-29 11:16:58,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:58,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:16:58,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:16:58,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:58,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:58,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593083082] [2025-04-29 11:16:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593083082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:58,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:58,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:58,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257213638] [2025-04-29 11:16:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:58,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:58,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:58,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:58,320 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:58,380 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2025-04-29 11:16:58,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:58,380 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:16:58,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:58,381 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:16:58,382 INFO L226 Difference]: Without dead ends: 105 [2025-04-29 11:16:58,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:58,382 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:58,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 100 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-29 11:16:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2025-04-29 11:16:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2025-04-29 11:16:58,384 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 20 [2025-04-29 11:16:58,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:58,385 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2025-04-29 11:16:58,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:58,385 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2025-04-29 11:16:58,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:16:58,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:58,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:58,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:16:58,385 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:58,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash -253639313, now seen corresponding path program 3 times [2025-04-29 11:16:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:58,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678610101] [2025-04-29 11:16:58,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:58,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-29 11:16:58,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 21 statements. [2025-04-29 11:16:58,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:16:58,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:16:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:58,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678610101] [2025-04-29 11:16:58,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678610101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:58,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514790939] [2025-04-29 11:16:58,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:58,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:58,521 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-04-29 11:16:58,523 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-04-29 11:16:58,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-29 11:16:58,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 21 statements. [2025-04-29 11:16:58,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:16:58,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:58,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:16:58,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:58,593 INFO L325 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2025-04-29 11:16:58,594 INFO L354 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 1 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:16:58,600 INFO L354 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 10 treesize of output 8 [2025-04-29 11:16:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:16:58,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:59,040 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:16:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:16:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514790939] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:59,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-29 11:16:59,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610340569] [2025-04-29 11:16:59,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:59,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:16:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:59,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:16:59,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:16:59,080 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:59,386 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2025-04-29 11:16:59,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:16:59,386 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:16:59,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:59,387 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:16:59,387 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:16:59,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:16:59,387 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:59,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 108 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:16:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:16:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2025-04-29 11:16:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.144736842105263) internal successors, (87), 82 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2025-04-29 11:16:59,389 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 21 [2025-04-29 11:16:59,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:59,390 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2025-04-29 11:16:59,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,390 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2025-04-29 11:16:59,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:16:59,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:59,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:59,398 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-04-29 11:16:59,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:59,593 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:59,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1813483065, now seen corresponding path program 1 times [2025-04-29 11:16:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:59,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269522141] [2025-04-29 11:16:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:59,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:16:59,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:16:59,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:59,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:59,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269522141] [2025-04-29 11:16:59,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269522141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:59,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:59,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119975985] [2025-04-29 11:16:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:59,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:59,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:59,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:59,625 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:59,647 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2025-04-29 11:16:59,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:59,647 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:16:59,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:59,648 INFO L225 Difference]: With dead ends: 82 [2025-04-29 11:16:59,648 INFO L226 Difference]: Without dead ends: 82 [2025-04-29 11:16:59,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:59,648 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:59,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 49 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-29 11:16:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-29 11:16:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.131578947368421) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2025-04-29 11:16:59,651 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 21 [2025-04-29 11:16:59,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:59,651 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2025-04-29 11:16:59,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,651 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2025-04-29 11:16:59,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:16:59,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:59,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:59,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:16:59,652 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:59,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash 383400275, now seen corresponding path program 1 times [2025-04-29 11:16:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:59,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204810418] [2025-04-29 11:16:59,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:59,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:16:59,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:16:59,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:59,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:59,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204810418] [2025-04-29 11:16:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204810418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588009887] [2025-04-29 11:16:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:59,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:59,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:59,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:59,724 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:59,744 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2025-04-29 11:16:59,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:59,744 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:16:59,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:59,744 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:16:59,745 INFO L226 Difference]: Without dead ends: 81 [2025-04-29 11:16:59,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:59,745 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:59,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-29 11:16:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-04-29 11:16:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.118421052631579) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-04-29 11:16:59,747 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 22 [2025-04-29 11:16:59,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:59,747 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-04-29 11:16:59,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:59,747 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-04-29 11:16:59,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:16:59,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:59,747 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-04-29 11:16:59,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:16:59,747 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:16:59,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1423774442, now seen corresponding path program 1 times [2025-04-29 11:16:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:59,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173467839] [2025-04-29 11:16:59,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:59,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:16:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:59,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173467839] [2025-04-29 11:16:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173467839] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:59,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265193401] [2025-04-29 11:16:59,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:59,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:59,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:59,830 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-04-29 11:16:59,831 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-04-29 11:16:59,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:59,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:59,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:59,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:59,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:59,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:16:59,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:59,981 INFO L354 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 30 treesize of output 26 [2025-04-29 11:17:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:17:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265193401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:00,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-04-29 11:17:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760849222] [2025-04-29 11:17:00,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:00,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:17:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:00,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:17:00,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:17:00,074 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:00,271 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2025-04-29 11:17:00,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:17:00,272 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:17:00,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:00,272 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:17:00,272 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:17:00,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:17:00,273 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 154 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:00,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 180 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:17:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2025-04-29 11:17:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-04-29 11:17:00,275 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 24 [2025-04-29 11:17:00,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:00,276 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-04-29 11:17:00,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,276 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-04-29 11:17:00,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:17:00,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:00,276 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-04-29 11:17:00,282 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-04-29 11:17:00,476 WARN L466 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-04-29 11:17:00,477 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:00,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash -919519658, now seen corresponding path program 1 times [2025-04-29 11:17:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:00,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44588673] [2025-04-29 11:17:00,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:00,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:17:00,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:17:00,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:00,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:17:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:00,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44588673] [2025-04-29 11:17:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44588673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436270238] [2025-04-29 11:17:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:00,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:00,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:00,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:00,603 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:00,650 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2025-04-29 11:17:00,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:00,651 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:17:00,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:00,651 INFO L225 Difference]: With dead ends: 83 [2025-04-29 11:17:00,651 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:17:00,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:00,653 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:00,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:17:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-29 11:17:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2025-04-29 11:17:00,654 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 24 [2025-04-29 11:17:00,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:00,654 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2025-04-29 11:17:00,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:00,654 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2025-04-29 11:17:00,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:17:00,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:00,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:00,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:17:00,655 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:00,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash 929026650, now seen corresponding path program 1 times [2025-04-29 11:17:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:00,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281074375] [2025-04-29 11:17:00,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:00,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:17:00,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:17:00,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:00,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:17:00,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:00,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281074375] [2025-04-29 11:17:00,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281074375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:00,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328381225] [2025-04-29 11:17:00,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:00,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:00,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:00,845 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-04-29 11:17:00,846 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-04-29 11:17:00,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:17:00,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:17:00,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:00,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:00,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:17:00,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:00,905 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:17:00,905 INFO L354 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 1 case distinctions, treesize of input 13 treesize of output 15 [2025-04-29 11:17:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:17:01,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:17:01,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328381225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:01,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:01,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-29 11:17:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63878730] [2025-04-29 11:17:01,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:01,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:17:01,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:01,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:17:01,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:17:01,444 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:01,874 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-04-29 11:17:01,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:17:01,874 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:17:01,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:01,875 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:17:01,875 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:17:01,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:17:01,876 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 110 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:01,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 90 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:17:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:17:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2025-04-29 11:17:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2025-04-29 11:17:01,878 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 28 [2025-04-29 11:17:01,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:01,878 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2025-04-29 11:17:01,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:01,878 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2025-04-29 11:17:01,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:17:01,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:01,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:01,885 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-04-29 11:17:02,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:02,083 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:02,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1950332125, now seen corresponding path program 1 times [2025-04-29 11:17:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:02,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111873464] [2025-04-29 11:17:02,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:02,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:02,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:02,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:02,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111873464] [2025-04-29 11:17:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111873464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:02,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40438804] [2025-04-29 11:17:02,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:02,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:02,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:02,399 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-04-29 11:17:02,400 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-04-29 11:17:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:02,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:02,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:02,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:02,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:17:02,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:02,470 INFO L354 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-04-29 11:17:02,582 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:17:02,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:17:02,681 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:17:02,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:02,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2025-04-29 11:17:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:17:02,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:02,851 INFO L325 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-04-29 11:17:02,851 INFO L354 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 2 case distinctions, treesize of input 74 treesize of output 82 [2025-04-29 11:17:02,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:02,857 INFO L354 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 82 treesize of output 82 [2025-04-29 11:17:02,863 INFO L354 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 6 treesize of output 4 [2025-04-29 11:17:02,888 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-29 11:17:02,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 72 [2025-04-29 11:17:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:17:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40438804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:03,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-04-29 11:17:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294036973] [2025-04-29 11:17:03,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:03,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:17:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:17:03,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:17:03,011 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 26 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:03,383 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-04-29 11:17:03,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:17:03,383 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:17:03,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:03,383 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:17:03,383 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:17:03,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:17:03,384 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:03,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:17:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-04-29 11:17:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-04-29 11:17:03,385 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 29 [2025-04-29 11:17:03,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:03,385 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-04-29 11:17:03,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,385 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-04-29 11:17:03,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:17:03,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:03,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:03,391 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-04-29 11:17:03,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:17:03,586 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:03,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -136346254, now seen corresponding path program 2 times [2025-04-29 11:17:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:03,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114566279] [2025-04-29 11:17:03,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:17:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:03,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-29 11:17:03,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:17:03,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:17:03,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:03,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:03,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114566279] [2025-04-29 11:17:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114566279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:03,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561015747] [2025-04-29 11:17:03,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:17:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:03,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:03,645 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-04-29 11:17:03,646 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-04-29 11:17:03,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-29 11:17:03,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:17:03,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:17:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:03,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:17:03,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:03,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561015747] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:03,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-29 11:17:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880395144] [2025-04-29 11:17:03,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:03,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:17:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:03,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:17:03,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:17:03,778 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:03,854 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-04-29 11:17:03,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:03,854 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:17:03,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:03,855 INFO L225 Difference]: With dead ends: 76 [2025-04-29 11:17:03,855 INFO L226 Difference]: Without dead ends: 76 [2025-04-29 11:17:03,855 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:17:03,855 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:03,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 71 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-29 11:17:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2025-04-29 11:17:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-04-29 11:17:03,857 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 31 [2025-04-29 11:17:03,857 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:03,857 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-04-29 11:17:03,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:03,857 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-04-29 11:17:03,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:17:03,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:03,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:03,863 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-04-29 11:17:04,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:17:04,058 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:04,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2115421046, now seen corresponding path program 2 times [2025-04-29 11:17:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:04,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067443962] [2025-04-29 11:17:04,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:17:04,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:04,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-29 11:17:04,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:17:04,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:17:04,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:04,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:04,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067443962] [2025-04-29 11:17:04,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067443962] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:04,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985899536] [2025-04-29 11:17:04,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:17:04,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:04,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:04,154 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-04-29 11:17:04,155 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-04-29 11:17:04,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-29 11:17:04,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:17:04,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:17:04,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:04,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:17:04,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:04,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:04,332 INFO L354 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 30 treesize of output 26 [2025-04-29 11:17:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985899536] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:04,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:04,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-29 11:17:04,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82097058] [2025-04-29 11:17:04,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:04,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:17:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:04,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:17:04,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:17:04,445 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:04,592 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-04-29 11:17:04,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:17:04,596 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:17:04,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:04,596 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:17:04,596 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:17:04,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:17:04,597 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:04,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 131 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:17:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2025-04-29 11:17:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-04-29 11:17:04,598 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2025-04-29 11:17:04,598 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:04,598 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-04-29 11:17:04,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:04,598 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-04-29 11:17:04,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:17:04,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:04,598 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:04,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:17:04,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:17:04,805 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:04,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -957126994, now seen corresponding path program 3 times [2025-04-29 11:17:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:04,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603111000] [2025-04-29 11:17:04,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:17:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:04,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-29 11:17:04,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 34 statements. [2025-04-29 11:17:04,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:17:04,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:17:04,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:04,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603111000] [2025-04-29 11:17:04,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603111000] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:04,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839180659] [2025-04-29 11:17:04,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:17:04,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:04,951 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-04-29 11:17:04,953 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-04-29 11:17:04,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-29 11:17:04,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 34 statements. [2025-04-29 11:17:04,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:17:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:04,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:17:04,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:05,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-04-29 11:17:05,018 INFO L354 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-04-29 11:17:05,025 INFO L354 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 10 treesize of output 8 [2025-04-29 11:17:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:17:05,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:17:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839180659] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:05,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-29 11:17:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367951764] [2025-04-29 11:17:05,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:05,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:17:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:05,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:17:05,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:17:05,580 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:05,989 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2025-04-29 11:17:05,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:17:05,989 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-29 11:17:05,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:05,990 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:17:05,990 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:17:05,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:17:05,990 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:05,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 27 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:17:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-04-29 11:17:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-04-29 11:17:05,992 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 34 [2025-04-29 11:17:05,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:05,992 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-04-29 11:17:05,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:05,992 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-04-29 11:17:05,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:17:05,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:05,992 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:05,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:06,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:17:06,197 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:06,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash -675854926, now seen corresponding path program 3 times [2025-04-29 11:17:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:06,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137937360] [2025-04-29 11:17:06,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:17:06,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:06,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-04-29 11:17:06,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 36 statements. [2025-04-29 11:17:06,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:17:06,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-29 11:17:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:06,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137937360] [2025-04-29 11:17:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137937360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:06,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862437325] [2025-04-29 11:17:06,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:17:06,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:06,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:06,262 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:06,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:17:06,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-04-29 11:17:06,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 36 statements. [2025-04-29 11:17:06,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:17:06,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:06,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:17:06,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-29 11:17:06,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:06,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-29 11:17:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-29 11:17:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862437325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:06,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:06,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-04-29 11:17:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755708745] [2025-04-29 11:17:06,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:06,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:17:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:06,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:17:06,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:17:06,481 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:06,590 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2025-04-29 11:17:06,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:17:06,590 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-29 11:17:06,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:06,591 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:17:06,591 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:17:06,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:17:06,592 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:06,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 45 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:17:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2025-04-29 11:17:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-04-29 11:17:06,593 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 36 [2025-04-29 11:17:06,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:06,593 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-04-29 11:17:06,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:06,594 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-04-29 11:17:06,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:17:06,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:06,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:06,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:17:06,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:06,794 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:06,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1771270339, now seen corresponding path program 2 times [2025-04-29 11:17:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:06,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887434236] [2025-04-29 11:17:06,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:17:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:06,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:17:06,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:17:06,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:17:06,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:07,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:07,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887434236] [2025-04-29 11:17:07,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887434236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:07,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879999511] [2025-04-29 11:17:07,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:17:07,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:07,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:07,120 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:07,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:17:07,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:17:07,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:17:07,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:17:07,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:07,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:17:07,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:07,223 INFO L354 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-04-29 11:17:07,302 INFO L354 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-04-29 11:17:07,339 INFO L354 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 19 treesize of output 18 [2025-04-29 11:17:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:07,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:07,663 INFO L325 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-04-29 11:17:07,663 INFO L354 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 2 case distinctions, treesize of input 84 treesize of output 92 [2025-04-29 11:17:07,673 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:07,673 INFO L354 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 92 treesize of output 92 [2025-04-29 11:17:07,683 INFO L354 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 6 treesize of output 4 [2025-04-29 11:17:07,722 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-29 11:17:07,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 256 [2025-04-29 11:17:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:17:07,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879999511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:07,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:07,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35 [2025-04-29 11:17:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563781675] [2025-04-29 11:17:07,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:07,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 11:17:07,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:07,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 11:17:07,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:17:07,911 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 35 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:08,166 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-04-29 11:17:08,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:17:08,166 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-29 11:17:08,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:08,167 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:17:08,167 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:17:08,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:17:08,167 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 133 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:08,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 135 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:17:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:17:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-04-29 11:17:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-04-29 11:17:08,169 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2025-04-29 11:17:08,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:08,169 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-04-29 11:17:08,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:08,169 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-04-29 11:17:08,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:17:08,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:08,169 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:08,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:17:08,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:17:08,370 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:17:08,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1347875847, now seen corresponding path program 3 times [2025-04-29 11:17:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:08,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040732549] [2025-04-29 11:17:08,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:17:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:08,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-29 11:17:08,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 41 statements. [2025-04-29 11:17:08,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:17:08,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-29 11:17:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:08,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040732549] [2025-04-29 11:17:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040732549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:08,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55400138] [2025-04-29 11:17:08,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:17:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:08,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:08,723 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:08,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:17:08,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-29 11:17:08,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 41 statements. [2025-04-29 11:17:08,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:17:08,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:08,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:17:08,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:08,803 INFO L354 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-04-29 11:17:08,859 INFO L354 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-04-29 11:17:08,904 INFO L354 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 19 treesize of output 18 [2025-04-29 11:17:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-29 11:17:09,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:09,319 INFO L354 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 25 [2025-04-29 11:17:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-29 11:17:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55400138] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:09,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:09,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2025-04-29 11:17:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862375822] [2025-04-29 11:17:09,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:09,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 11:17:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:09,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 11:17:09,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:17:09,343 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:09,907 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2025-04-29 11:17:09,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-29 11:17:09,907 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:17:09,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:09,908 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:17:09,908 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:17:09,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2025-04-29 11:17:09,909 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:09,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 35 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:17:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:17:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:17:09,910 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2025-04-29 11:17:09,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:09,910 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:17:09,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:17:09,910 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:17:09,910 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-04-29 11:17:09,912 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (12 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (10 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (9 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (8 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (7 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2025-04-29 11:17:09,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2025-04-29 11:17:09,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:10,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:10,116 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:10,117 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:17:10,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:17:10 BoogieIcfgContainer [2025-04-29 11:17:10,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:17:10,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:17:10,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:17:10,119 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:17:10,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:52" (3/4) ... [2025-04-29 11:17:10,121 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:17:10,128 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-04-29 11:17:10,129 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-29 11:17:10,129 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:17:10,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:17:10,184 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:17:10,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:17:10,185 INFO L158 Benchmark]: Toolchain (without parser) took 18434.71ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 124.2MB in the beginning and 177.6MB in the end (delta: -53.3MB). Peak memory consumption was 213.8MB. Max. memory is 16.1GB. [2025-04-29 11:17:10,185 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:17:10,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.03ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 110.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:17:10,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.45ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:17:10,186 INFO L158 Benchmark]: Boogie Preprocessor took 31.52ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:17:10,187 INFO L158 Benchmark]: RCFGBuilder took 234.58ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 92.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:17:10,188 INFO L158 Benchmark]: TraceAbstraction took 17871.67ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 91.3MB in the beginning and 181.9MB in the end (delta: -90.6MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. [2025-04-29 11:17:10,188 INFO L158 Benchmark]: Witness Printer took 65.25ms. Allocated memory is still 436.2MB. Free memory was 181.9MB in the beginning and 177.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:17:10,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.03ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 110.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.45ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.52ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.58ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 92.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17871.67ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 91.3MB in the beginning and 181.9MB in the end (delta: -90.6MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. * Witness Printer took 65.25ms. Allocated memory is still 436.2MB. Free memory was 181.9MB in the beginning and 177.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 61 edges, 23 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2262 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2262 mSDsluCounter, 3581 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2658 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5098 IncrementalHoareTripleChecker+Invalid, 5417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 923 mSDtfsCounter, 5098 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 635 SyntacticMatches, 11 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2825 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, InterpolantAutomatonStates: 271, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 567 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1007 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1341 ConstructedInterpolants, 66 QuantifiedInterpolants, 14324 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1627 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 61 InterpolantComputations, 16 PerfectInterpolantSequences, 546/771 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:17:10,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE