./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/960521-1-2.i -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 19e2947f690bcfa099d607c2a0a6dc0e6f351f54e3f3874a42109cbf9e336957 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:47:01,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:47:01,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:47:01,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:47:01,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:47:01,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:47:01,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:47:01,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:47:01,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:47:01,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:47:01,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:47:01,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:47:01,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:47:01,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:47:01,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:47:01,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:47:01,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:47:01,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:47:01,143 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:47:01,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:47:01,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:47:01,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:47:01,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:01,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:47:01,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:47:01,144 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 -> 19e2947f690bcfa099d607c2a0a6dc0e6f351f54e3f3874a42109cbf9e336957 [2025-03-08 22:47:01,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:47:01,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:47:01,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:47:01,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:47:01,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:47:01,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-2.i [2025-03-08 22:47:02,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79c7dd88/ef925b35f9c74886b942e30aa9dbac01/FLAG7d0d0213e [2025-03-08 22:47:02,874 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:47:02,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-2.i [2025-03-08 22:47:02,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79c7dd88/ef925b35f9c74886b942e30aa9dbac01/FLAG7d0d0213e [2025-03-08 22:47:03,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79c7dd88/ef925b35f9c74886b942e30aa9dbac01 [2025-03-08 22:47:03,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:47:03,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:47:03,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:03,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:47:03,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:47:03,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f54a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03, skipping insertion in model container [2025-03-08 22:47:03,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:47:03,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:03,407 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:47:03,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:03,464 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:47:03,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03 WrapperNode [2025-03-08 22:47:03,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:03,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:03,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:47:03,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:47:03,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,499 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-03-08 22:47:03,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:03,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:47:03,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:47:03,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:47:03,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,524 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-08 22:47:03,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:47:03,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:47:03,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:47:03,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:47:03,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:03,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:03,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:47:03,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:47:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:47:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:47:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:47:03,678 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:47:03,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:47:03,841 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 22:47:03,841 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:47:03,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:47:03,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:47:03,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:03 BoogieIcfgContainer [2025-03-08 22:47:03,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:47:03,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:47:03,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:47:03,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:47:03,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:47:03" (1/3) ... [2025-03-08 22:47:03,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f902199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:03, skipping insertion in model container [2025-03-08 22:47:03,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (2/3) ... [2025-03-08 22:47:03,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f902199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:03, skipping insertion in model container [2025-03-08 22:47:03,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:03" (3/3) ... [2025-03-08 22:47:03,857 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1-2.i [2025-03-08 22:47:03,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:47:03,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1-2.i that has 1 procedures, 50 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-03-08 22:47:03,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:47:03,909 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60fbad40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:47:03,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-08 22:47:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 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-03-08 22:47:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:47:03,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:03,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:47:03,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:03,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 80400, now seen corresponding path program 1 times [2025-03-08 22:47:03,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:03,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346607675] [2025-03-08 22:47:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:03,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:47:04,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:47:04,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:04,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346607675] [2025-03-08 22:47:04,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346607675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:04,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933194538] [2025-03-08 22:47:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:04,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:04,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:04,129 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:47:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,172 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-03-08 22:47:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-08 22:47:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,178 INFO L225 Difference]: With dead ends: 49 [2025-03-08 22:47:04,178 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 22:47:04,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:04,182 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 22:47:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 22:47:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 46 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-03-08 22:47:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-08 22:47:04,204 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2025-03-08 22:47:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,205 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-08 22:47:04,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:47:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-08 22:47:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:47:04,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:47:04,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:47:04,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:04,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash 80401, now seen corresponding path program 1 times [2025-03-08 22:47:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176680339] [2025-03-08 22:47:04,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:47:04,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:47:04,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:04,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176680339] [2025-03-08 22:47:04,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176680339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:04,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:04,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:04,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5921109] [2025-03-08 22:47:04,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:04,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:04,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:04,341 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:47:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,362 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-03-08 22:47:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:04,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-08 22:47:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,365 INFO L225 Difference]: With dead ends: 46 [2025-03-08 22:47:04,365 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 22:47:04,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:04,366 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 22:47:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 22:47:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 45 states have internal predecessors, (48), 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-03-08 22:47:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-03-08 22:47:04,371 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 3 [2025-03-08 22:47:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,371 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-03-08 22:47:04,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:47:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-03-08 22:47:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:47:04,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:47:04,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:47:04,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755043, now seen corresponding path program 1 times [2025-03-08 22:47:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002147078] [2025-03-08 22:47:04,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:47:04,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:47:04,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002147078] [2025-03-08 22:47:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002147078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:04,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:04,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:47:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427022790] [2025-03-08 22:47:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:04,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:04,484 INFO L87 Difference]: Start difference. First operand 46 states and 48 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-03-08 22:47:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,519 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-03-08 22:47:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:04,519 INFO L78 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-03-08 22:47:04,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,520 INFO L225 Difference]: With dead ends: 43 [2025-03-08 22:47:04,520 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 22:47:04,520 INFO L434 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-03-08 22:47:04,521 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 50 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 22:47:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 22:47:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 42 states have internal predecessors, (45), 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-03-08 22:47:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-03-08 22:47:04,527 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 6 [2025-03-08 22:47:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,528 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-03-08 22:47:04,528 INFO L472 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-03-08 22:47:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-03-08 22:47:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:47:04,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:47:04,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:47:04,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:04,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755042, now seen corresponding path program 1 times [2025-03-08 22:47:04,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273796923] [2025-03-08 22:47:04,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:47:04,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:47:04,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,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-03-08 22:47:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273796923] [2025-03-08 22:47:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273796923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:04,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:04,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:04,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571761767] [2025-03-08 22:47:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:47:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:47:04,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:04,729 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-03-08 22:47:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,820 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-03-08 22:47:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:47:04,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-03-08 22:47:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,821 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:47:04,821 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 22:47:04,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:04,822 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 61 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 22:47:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-08 22:47:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 43 states have internal predecessors, (47), 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-03-08 22:47:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-03-08 22:47:04,825 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 6 [2025-03-08 22:47:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,825 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-03-08 22:47:04,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-03-08 22:47:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-03-08 22:47:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:47:04,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:04,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:47:04,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:04,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1237130887, now seen corresponding path program 1 times [2025-03-08 22:47:04,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406918472] [2025-03-08 22:47:04,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:47:04,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:47:04,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406918472] [2025-03-08 22:47:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406918472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695763232] [2025-03-08 22:47:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:04,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:04,870 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-03-08 22:47:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,891 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-08 22:47:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:47:04,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-08 22:47:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,892 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:47:04,892 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 22:47:04,892 INFO L434 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-03-08 22:47:04,892 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 22:47:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-08 22:47:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 43 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-03-08 22:47:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-03-08 22:47:04,896 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 7 [2025-03-08 22:47:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,896 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-03-08 22:47:04,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-03-08 22:47:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-03-08 22:47:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:47:04,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,896 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:04,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:47:04,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash -818415572, now seen corresponding path program 1 times [2025-03-08 22:47:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511055543] [2025-03-08 22:47:04,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:47:04,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:47:04,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:05,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511055543] [2025-03-08 22:47:05,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511055543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961989926] [2025-03-08 22:47:05,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:05,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:05,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:05,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:05,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:47:05,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:47:05,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:47:05,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:05,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:05,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:47:05,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:05,297 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:47:05,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2025-03-08 22:47:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:05,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:05,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961989926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:05,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:05,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-03-08 22:47:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975727538] [2025-03-08 22:47:05,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:05,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:47:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:05,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:47:05,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:47:05,583 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 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-03-08 22:47:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:05,931 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-03-08 22:47:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:47:05,931 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 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-03-08 22:47:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:05,932 INFO L225 Difference]: With dead ends: 61 [2025-03-08 22:47:05,932 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 22:47:05,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:47:05,933 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:05,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 101 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 22:47:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-03-08 22:47:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 58 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-03-08 22:47:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-08 22:47:05,939 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2025-03-08 22:47:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:05,939 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-08 22:47:05,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 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-03-08 22:47:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-08 22:47:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:47:05,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:05,940 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2025-03-08 22:47:05,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:06,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 22:47:06,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:06,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1876917154, now seen corresponding path program 2 times [2025-03-08 22:47:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:06,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591223953] [2025-03-08 22:47:06,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:06,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:06,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 22:47:06,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:47:06,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:06,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:06,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591223953] [2025-03-08 22:47:06,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591223953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:06,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781660215] [2025-03-08 22:47:06,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:06,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:06,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:06,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:06,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:47:06,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 22:47:06,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:47:06,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:06,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:06,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:47:06,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:06,617 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:47:06,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2025-03-08 22:47:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:06,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781660215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:07,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 22:47:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852109521] [2025-03-08 22:47:07,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:07,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:47:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:07,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:47:07,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:47:07,348 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 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-03-08 22:47:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:07,773 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-03-08 22:47:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:47:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 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-03-08 22:47:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:07,775 INFO L225 Difference]: With dead ends: 77 [2025-03-08 22:47:07,775 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 22:47:07,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=700, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:47:07,776 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 218 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:07,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 183 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 22:47:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-03-08 22:47:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 68 states have internal predecessors, (79), 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-03-08 22:47:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-03-08 22:47:07,780 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 18 [2025-03-08 22:47:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:07,780 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-03-08 22:47:07,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 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-03-08 22:47:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-03-08 22:47:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:47:07,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:07,781 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:07,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:47:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 22:47:07,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573895, now seen corresponding path program 1 times [2025-03-08 22:47:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506187066] [2025-03-08 22:47:07,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:07,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:47:07,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:47:07,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:07,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 22:47:08,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:08,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506187066] [2025-03-08 22:47:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506187066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:08,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:08,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:47:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061782368] [2025-03-08 22:47:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:08,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:08,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:08,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:08,032 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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-03-08 22:47:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:08,063 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-08 22:47:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:47:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 25 [2025-03-08 22:47:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:08,064 INFO L225 Difference]: With dead ends: 67 [2025-03-08 22:47:08,064 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 22:47:08,064 INFO L434 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-03-08 22:47:08,064 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:08,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 22:47:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 22:47:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 66 states have internal predecessors, (73), 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-03-08 22:47:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-03-08 22:47:08,067 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 25 [2025-03-08 22:47:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:08,067 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-03-08 22:47:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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-03-08 22:47:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-03-08 22:47:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:47:08,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:08,069 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:08,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:47:08,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:08,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573896, now seen corresponding path program 1 times [2025-03-08 22:47:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:08,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126153238] [2025-03-08 22:47:08,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:08,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:08,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:47:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:47:08,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:08,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126153238] [2025-03-08 22:47:08,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126153238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260729490] [2025-03-08 22:47:08,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:08,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:08,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:08,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:08,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:47:08,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:47:08,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:47:08,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:08,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:08,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:47:08,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:08,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260729490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:08,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-08 22:47:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715662457] [2025-03-08 22:47:08,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:08,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:47:08,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:08,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:47:08,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:47:08,492 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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-03-08 22:47:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:08,718 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2025-03-08 22:47:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:47:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 25 [2025-03-08 22:47:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:08,719 INFO L225 Difference]: With dead ends: 115 [2025-03-08 22:47:08,719 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 22:47:08,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:47:08,719 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 181 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:08,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 166 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 22:47:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2025-03-08 22:47:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 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-03-08 22:47:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-03-08 22:47:08,723 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 25 [2025-03-08 22:47:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:08,723 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-03-08 22:47:08,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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-03-08 22:47:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-03-08 22:47:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 22:47:08,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:08,724 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:08,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:08,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:08,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:08,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2014809656, now seen corresponding path program 2 times [2025-03-08 22:47:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813172530] [2025-03-08 22:47:08,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:08,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 22:47:08,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 49 statements. [2025-03-08 22:47:08,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:47:08,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-08 22:47:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813172530] [2025-03-08 22:47:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813172530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956512042] [2025-03-08 22:47:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:09,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:47:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:09,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:47:09,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:09,043 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-03-08 22:47:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:09,119 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-03-08 22:47:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:47:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 49 [2025-03-08 22:47:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:09,121 INFO L225 Difference]: With dead ends: 92 [2025-03-08 22:47:09,121 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 22:47:09,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:47:09,121 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:09,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 22:47:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 22:47:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 91 states have internal predecessors, (98), 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-03-08 22:47:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-03-08 22:47:09,126 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 49 [2025-03-08 22:47:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-03-08 22:47:09,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-03-08 22:47:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-03-08 22:47:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:47:09,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:09,127 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:09,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:47:09,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:09,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1026525989, now seen corresponding path program 1 times [2025-03-08 22:47:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990264257] [2025-03-08 22:47:09,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:09,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:47:09,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:47:09,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:09,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:47:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990264257] [2025-03-08 22:47:09,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990264257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004939856] [2025-03-08 22:47:09,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:09,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:09,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:09,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:09,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:47:09,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:47:09,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:47:09,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:09,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:09,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:47:09,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:47:09,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:47:10,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004939856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:10,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:10,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-03-08 22:47:10,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453088454] [2025-03-08 22:47:10,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:10,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 22:47:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:10,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 22:47:10,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 22:47:10,121 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 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-03-08 22:47:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:10,669 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2025-03-08 22:47:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 22:47:10,669 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 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 52 [2025-03-08 22:47:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:10,670 INFO L225 Difference]: With dead ends: 206 [2025-03-08 22:47:10,670 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 22:47:10,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 22:47:10,672 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 533 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:10,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 88 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 22:47:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2025-03-08 22:47:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 156 states have (on average 1.141025641025641) internal successors, (178), 163 states have internal predecessors, (178), 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-03-08 22:47:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2025-03-08 22:47:10,677 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 52 [2025-03-08 22:47:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:10,677 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2025-03-08 22:47:10,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 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-03-08 22:47:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2025-03-08 22:47:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 22:47:10,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:10,678 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:10,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:47:10,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:10,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:10,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash -419275045, now seen corresponding path program 2 times [2025-03-08 22:47:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:10,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231764342] [2025-03-08 22:47:10,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:10,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:10,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 22:47:10,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:47:10,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:10,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-03-08 22:47:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231764342] [2025-03-08 22:47:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231764342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:11,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212075660] [2025-03-08 22:47:11,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:11,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:11,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:11,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:11,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:47:11,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 22:47:11,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:47:11,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:11,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:11,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:47:11,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:47:12,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:47:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212075660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:13,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 34, 34] total 71 [2025-03-08 22:47:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255128124] [2025-03-08 22:47:13,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:13,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-08 22:47:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:13,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-08 22:47:13,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2100, Invalid=2870, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 22:47:13,087 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 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-03-08 22:47:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:18,168 INFO L93 Difference]: Finished difference Result 397 states and 428 transitions. [2025-03-08 22:47:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-08 22:47:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 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 100 [2025-03-08 22:47:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:18,169 INFO L225 Difference]: With dead ends: 397 [2025-03-08 22:47:18,169 INFO L226 Difference]: Without dead ends: 397 [2025-03-08 22:47:18,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6458 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8917, Invalid=17815, Unknown=0, NotChecked=0, Total=26732 [2025-03-08 22:47:18,174 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1046 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:18,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 101 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:47:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-08 22:47:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 307. [2025-03-08 22:47:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 300 states have (on average 1.0266666666666666) internal successors, (308), 306 states have internal predecessors, (308), 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-03-08 22:47:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2025-03-08 22:47:18,196 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 100 [2025-03-08 22:47:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2025-03-08 22:47:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 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-03-08 22:47:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2025-03-08 22:47:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-08 22:47:18,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:18,201 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:18,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:47:18,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 22:47:18,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1046795783, now seen corresponding path program 1 times [2025-03-08 22:47:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393865130] [2025-03-08 22:47:18,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:18,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-08 22:47:18,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-08 22:47:18,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:18,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7161 trivial. 0 not checked. [2025-03-08 22:47:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393865130] [2025-03-08 22:47:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393865130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512214986] [2025-03-08 22:47:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:18,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:18,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:18,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:18,571 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-03-08 22:47:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:18,582 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2025-03-08 22:47:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:18,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 290 [2025-03-08 22:47:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:18,585 INFO L225 Difference]: With dead ends: 305 [2025-03-08 22:47:18,585 INFO L226 Difference]: Without dead ends: 305 [2025-03-08 22:47:18,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:18,586 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:18,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-08 22:47:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-08 22:47:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 300 states have (on average 1.02) internal successors, (306), 304 states have internal predecessors, (306), 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-03-08 22:47:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2025-03-08 22:47:18,591 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 290 [2025-03-08 22:47:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:18,592 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2025-03-08 22:47:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-03-08 22:47:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2025-03-08 22:47:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-08 22:47:18,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:18,595 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:47:18,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash 948399557, now seen corresponding path program 1 times [2025-03-08 22:47:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466722298] [2025-03-08 22:47:18,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:18,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-08 22:47:18,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-08 22:47:18,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:18,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 22:47:21,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466722298] [2025-03-08 22:47:21,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466722298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075206053] [2025-03-08 22:47:21,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:21,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:21,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:21,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:21,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:47:21,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-08 22:47:21,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-08 22:47:21,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:21,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 22:47:21,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 22:47:23,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 22:47:26,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075206053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:26,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:26,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 193 [2025-03-08 22:47:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595842614] [2025-03-08 22:47:26,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-08 22:47:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:26,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-08 22:47:26,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16387, Invalid=20669, Unknown=0, NotChecked=0, Total=37056 [2025-03-08 22:47:26,847 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 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-03-08 22:47:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:34,265 INFO L93 Difference]: Finished difference Result 779 states and 842 transitions. [2025-03-08 22:47:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-08 22:47:34,267 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 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 292 [2025-03-08 22:47:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:34,269 INFO L225 Difference]: With dead ends: 779 [2025-03-08 22:47:34,269 INFO L226 Difference]: Without dead ends: 779 [2025-03-08 22:47:34,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23937 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=24640, Invalid=40640, Unknown=0, NotChecked=0, Total=65280 [2025-03-08 22:47:34,272 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1659 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:34,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 118 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 22:47:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-08 22:47:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 593. [2025-03-08 22:47:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 588 states have (on average 1.010204081632653) internal successors, (594), 592 states have internal predecessors, (594), 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-03-08 22:47:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2025-03-08 22:47:34,281 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 292 [2025-03-08 22:47:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:34,281 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2025-03-08 22:47:34,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 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-03-08 22:47:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2025-03-08 22:47:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-08 22:47:34,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:34,289 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:34,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:47:34,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:34,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-08 22:47:34,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash -469572667, now seen corresponding path program 2 times [2025-03-08 22:47:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:34,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285186980] [2025-03-08 22:47:34,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:34,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 580 statements into 2 equivalence classes. [2025-03-08 22:47:34,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 22:47:34,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:34,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 23751 trivial. 0 not checked. [2025-03-08 22:47:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285186980] [2025-03-08 22:47:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285186980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660143574] [2025-03-08 22:47:38,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:38,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:38,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:38,229 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:38,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:47:38,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 580 statements into 2 equivalence classes. [2025-03-08 22:47:38,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 22:47:38,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:38,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:38,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 2165 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-08 22:47:38,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-03-08 22:47:44,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-03-08 22:47:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660143574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:55,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:55,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 130, 130] total 322 [2025-03-08 22:47:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807092875] [2025-03-08 22:47:55,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:55,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 322 states [2025-03-08 22:47:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:55,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 322 interpolants. [2025-03-08 22:47:55,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37122, Invalid=66240, Unknown=0, NotChecked=0, Total=103362 [2025-03-08 22:47:55,841 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand has 322 states, 322 states have (on average 3.0217391304347827) internal successors, (973), 322 states have internal predecessors, (973), 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)