./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/lockfree-3.0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.0.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 ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:43:55,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:43:55,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:43:55,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:43:55,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:43:56,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:43:56,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:43:56,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:43:56,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:43:56,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:43:56,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:43:56,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:43:56,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:43:56,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:43:56,004 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:43:56,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:43:56,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:43:56,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:43:56,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:56,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:56,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:43:56,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:43:56,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:43:56,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:43:56,008 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 -> ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea [2025-04-30 10:43:56,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:43:56,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:43:56,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:43:56,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:43:56,246 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:43:56,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0.i [2025-04-30 10:43:57,499 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1532d6743/244aac477ae14edda6d94ec063dc3d2c/FLAG9961253a7 [2025-04-30 10:43:57,717 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:43:57,718 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.0.i [2025-04-30 10:43:57,726 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1532d6743/244aac477ae14edda6d94ec063dc3d2c/FLAG9961253a7 [2025-04-30 10:43:58,651 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1532d6743/244aac477ae14edda6d94ec063dc3d2c [2025-04-30 10:43:58,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:43:58,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:43:58,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:43:58,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:43:58,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:43:58,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:43:58" (1/1) ... [2025-04-30 10:43:58,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79160cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:58, skipping insertion in model container [2025-04-30 10:43:58,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:43:58" (1/1) ... [2025-04-30 10:43:58,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:43:58,947 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:43:58,958 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:43:59,003 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:43:59,026 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:43:59,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59 WrapperNode [2025-04-30 10:43:59,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:43:59,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:43:59,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:43:59,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:43:59,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,064 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2025-04-30 10:43:59,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:43:59,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:43:59,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:43:59,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:43:59,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,091 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-04-30 10:43:59,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:43:59,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:43:59,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:43:59,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:43:59,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (1/1) ... [2025-04-30 10:43:59,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:59,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:43:59,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:43:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:43:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:43:59,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:43:59,224 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:43:59,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:43:59,393 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-30 10:43:59,393 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:43:59,402 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:43:59,403 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:43:59,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:43:59 BoogieIcfgContainer [2025-04-30 10:43:59,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:43:59,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:43:59,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:43:59,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:43:59,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:43:58" (1/3) ... [2025-04-30 10:43:59,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77925563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:43:59, skipping insertion in model container [2025-04-30 10:43:59,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:59" (2/3) ... [2025-04-30 10:43:59,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77925563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:43:59, skipping insertion in model container [2025-04-30 10:43:59,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:43:59" (3/3) ... [2025-04-30 10:43:59,412 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.i [2025-04-30 10:43:59,422 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:43:59,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.0.i that has 1 procedures, 64 locations, 82 edges, 1 initial locations, 2 loop locations, and 20 error locations. [2025-04-30 10:43:59,454 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:43:59,464 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6fcbb025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:43:59,465 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-30 10:43:59,467 INFO L278 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 63 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:59,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:43:59,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:59,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:43:59,472 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:43:59,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash 28820323, now seen corresponding path program 1 times [2025-04-30 10:43:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:59,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485555646] [2025-04-30 10:43:59,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:59,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:43:59,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:43:59,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:59,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:59,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485555646] [2025-04-30 10:43:59,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485555646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:59,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:59,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:59,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651882611] [2025-04-30 10:43:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:59,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:43:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:59,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:43:59,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:43:59,587 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 63 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:59,598 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-04-30 10:43:59,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:43:59,599 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:43:59,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:59,604 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:43:59,605 INFO L226 Difference]: Without dead ends: 62 [2025-04-30 10:43:59,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:43:59,608 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:59,611 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-30 10:43:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-30 10:43:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 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-04-30 10:43:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-04-30 10:43:59,633 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2025-04-30 10:43:59,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:59,633 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-30 10:43:59,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:59,633 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-04-30 10:43:59,633 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:43:59,633 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:59,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:59,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:43:59,634 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:43:59,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1805898957, now seen corresponding path program 1 times [2025-04-30 10:43:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:59,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866438574] [2025-04-30 10:43:59,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:59,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:43:59,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:43:59,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:59,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:59,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:59,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866438574] [2025-04-30 10:43:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866438574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:59,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:43:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880518897] [2025-04-30 10:43:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:59,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:59,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:59,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:59,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:59,678 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-04-30 10:43:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:59,694 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-04-30 10:43:59,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:59,695 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-04-30 10:43:59,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:59,696 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:43:59,697 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:43:59,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:59,698 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:59,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:43:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-30 10:43:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-04-30 10:43:59,703 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2025-04-30 10:43:59,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:59,703 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-04-30 10:43:59,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-04-30 10:43:59,703 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-04-30 10:43:59,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:43:59,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:59,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:59,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:43:59,703 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:43:59,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:59,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958539, now seen corresponding path program 1 times [2025-04-30 10:43:59,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:59,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513022914] [2025-04-30 10:43:59,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:59,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:43:59,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:43:59,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:59,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:59,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513022914] [2025-04-30 10:43:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513022914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:59,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869607126] [2025-04-30 10:43:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:59,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:59,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:59,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:59,756 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-04-30 10:43:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:59,806 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2025-04-30 10:43:59,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:59,807 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-04-30 10:43:59,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:59,808 INFO L225 Difference]: With dead ends: 117 [2025-04-30 10:43:59,808 INFO L226 Difference]: Without dead ends: 116 [2025-04-30 10:43:59,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:59,808 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:59,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-30 10:43:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2025-04-30 10:43:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-04-30 10:43:59,818 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 7 [2025-04-30 10:43:59,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:59,818 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-04-30 10:43:59,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-04-30 10:43:59,818 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-04-30 10:43:59,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:43:59,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:59,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:59,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:43:59,819 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:43:59,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958155, now seen corresponding path program 1 times [2025-04-30 10:43:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:59,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286843086] [2025-04-30 10:43:59,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:59,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:43:59,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:43:59,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:59,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:59,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:59,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286843086] [2025-04-30 10:43:59,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286843086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:59,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:59,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949725397] [2025-04-30 10:43:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:59,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:59,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:59,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:59,880 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-04-30 10:43:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:59,915 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2025-04-30 10:43:59,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:59,915 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-04-30 10:43:59,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:59,916 INFO L225 Difference]: With dead ends: 178 [2025-04-30 10:43:59,916 INFO L226 Difference]: Without dead ends: 177 [2025-04-30 10:43:59,917 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:59,917 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:59,917 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 140 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-30 10:43:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2025-04-30 10:43:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.8432835820895523) internal successors, (247), 153 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 247 transitions. [2025-04-30 10:43:59,928 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 247 transitions. Word has length 7 [2025-04-30 10:43:59,928 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:59,928 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 247 transitions. [2025-04-30 10:43:59,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-04-30 10:43:59,928 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 247 transitions. [2025-04-30 10:43:59,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:43:59,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:59,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:59,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:43:59,929 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:43:59,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:59,929 INFO L85 PathProgramCache]: Analyzing trace with hash 296297806, now seen corresponding path program 1 times [2025-04-30 10:43:59,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:59,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461159588] [2025-04-30 10:43:59,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:59,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:59,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:43:59,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:43:59,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:59,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461159588] [2025-04-30 10:44:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461159588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:00,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:00,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:00,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182726102] [2025-04-30 10:44:00,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:00,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:00,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:00,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:00,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:00,026 INFO L87 Difference]: Start difference. First operand 154 states and 247 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:00,061 INFO L93 Difference]: Finished difference Result 159 states and 253 transitions. [2025-04-30 10:44:00,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:00,061 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:44:00,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:00,062 INFO L225 Difference]: With dead ends: 159 [2025-04-30 10:44:00,062 INFO L226 Difference]: Without dead ends: 159 [2025-04-30 10:44:00,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:00,063 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:00,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 211 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-30 10:44:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-04-30 10:44:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 136 states have (on average 1.8308823529411764) internal successors, (249), 155 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 249 transitions. [2025-04-30 10:44:00,075 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 249 transitions. Word has length 9 [2025-04-30 10:44:00,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:00,075 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 249 transitions. [2025-04-30 10:44:00,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,075 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 249 transitions. [2025-04-30 10:44:00,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:00,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:00,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:00,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:44:00,076 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:00,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 353556108, now seen corresponding path program 1 times [2025-04-30 10:44:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:00,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526296786] [2025-04-30 10:44:00,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:00,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:00,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:00,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:00,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526296786] [2025-04-30 10:44:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526296786] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:00,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451240256] [2025-04-30 10:44:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:00,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:00,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:00,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:00,131 INFO L87 Difference]: Start difference. First operand 156 states and 249 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:00,186 INFO L93 Difference]: Finished difference Result 235 states and 359 transitions. [2025-04-30 10:44:00,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:00,187 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:44:00,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:00,188 INFO L225 Difference]: With dead ends: 235 [2025-04-30 10:44:00,188 INFO L226 Difference]: Without dead ends: 235 [2025-04-30 10:44:00,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:00,188 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 69 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:00,189 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-30 10:44:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2025-04-30 10:44:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.7692307692307692) internal successors, (345), 212 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 345 transitions. [2025-04-30 10:44:00,203 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 345 transitions. Word has length 9 [2025-04-30 10:44:00,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:00,203 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 345 transitions. [2025-04-30 10:44:00,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,203 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 345 transitions. [2025-04-30 10:44:00,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:00,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:00,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:00,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:44:00,204 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:00,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash 353556109, now seen corresponding path program 1 times [2025-04-30 10:44:00,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:00,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335886726] [2025-04-30 10:44:00,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:00,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:00,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:00,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:00,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335886726] [2025-04-30 10:44:00,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335886726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:00,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:00,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:00,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534491798] [2025-04-30 10:44:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:00,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:00,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:00,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:00,265 INFO L87 Difference]: Start difference. First operand 213 states and 345 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:00,303 INFO L93 Difference]: Finished difference Result 230 states and 350 transitions. [2025-04-30 10:44:00,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:00,303 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:44:00,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:00,304 INFO L225 Difference]: With dead ends: 230 [2025-04-30 10:44:00,304 INFO L226 Difference]: Without dead ends: 230 [2025-04-30 10:44:00,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:00,306 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 68 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:00,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 181 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-04-30 10:44:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 211. [2025-04-30 10:44:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 195 states have (on average 1.7282051282051283) internal successors, (337), 210 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 337 transitions. [2025-04-30 10:44:00,311 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 337 transitions. Word has length 9 [2025-04-30 10:44:00,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:00,311 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 337 transitions. [2025-04-30 10:44:00,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,311 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 337 transitions. [2025-04-30 10:44:00,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:00,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:00,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:00,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:44:00,312 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:00,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:00,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1924654535, now seen corresponding path program 1 times [2025-04-30 10:44:00,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:00,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228773614] [2025-04-30 10:44:00,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:00,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:00,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:00,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:00,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228773614] [2025-04-30 10:44:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228773614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:00,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351628516] [2025-04-30 10:44:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:00,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:00,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:00,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:00,371 INFO L87 Difference]: Start difference. First operand 211 states and 337 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:00,413 INFO L93 Difference]: Finished difference Result 392 states and 600 transitions. [2025-04-30 10:44:00,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:00,413 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:00,414 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:00,415 INFO L225 Difference]: With dead ends: 392 [2025-04-30 10:44:00,415 INFO L226 Difference]: Without dead ends: 392 [2025-04-30 10:44:00,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:00,415 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:00,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 264 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-30 10:44:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2025-04-30 10:44:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 349 states have (on average 1.659025787965616) internal successors, (579), 364 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 579 transitions. [2025-04-30 10:44:00,428 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 579 transitions. Word has length 10 [2025-04-30 10:44:00,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:00,429 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 579 transitions. [2025-04-30 10:44:00,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,431 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 579 transitions. [2025-04-30 10:44:00,431 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:44:00,431 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:00,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:00,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:44:00,431 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:00,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash 516607341, now seen corresponding path program 1 times [2025-04-30 10:44:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:00,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110072352] [2025-04-30 10:44:00,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:00,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:44:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:44:00,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:00,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110072352] [2025-04-30 10:44:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110072352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588218966] [2025-04-30 10:44:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:00,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:00,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:00,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:00,491 INFO L87 Difference]: Start difference. First operand 365 states and 579 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:00,517 INFO L93 Difference]: Finished difference Result 588 states and 890 transitions. [2025-04-30 10:44:00,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:00,517 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-04-30 10:44:00,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:00,519 INFO L225 Difference]: With dead ends: 588 [2025-04-30 10:44:00,520 INFO L226 Difference]: Without dead ends: 588 [2025-04-30 10:44:00,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:00,520 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:00,520 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 203 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-04-30 10:44:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 569. [2025-04-30 10:44:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 553 states have (on average 1.5822784810126582) internal successors, (875), 568 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 875 transitions. [2025-04-30 10:44:00,534 INFO L79 Accepts]: Start accepts. Automaton has 569 states and 875 transitions. Word has length 11 [2025-04-30 10:44:00,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:00,534 INFO L485 AbstractCegarLoop]: Abstraction has 569 states and 875 transitions. [2025-04-30 10:44:00,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,534 INFO L278 IsEmpty]: Start isEmpty. Operand 569 states and 875 transitions. [2025-04-30 10:44:00,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:44:00,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:00,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:00,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:44:00,535 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:00,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1842808106, now seen corresponding path program 1 times [2025-04-30 10:44:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:00,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564193483] [2025-04-30 10:44:00,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:00,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:00,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:00,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564193483] [2025-04-30 10:44:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564193483] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:00,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643363855] [2025-04-30 10:44:00,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:00,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:00,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:44:00,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:00,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:00,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:00,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:44:00,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643363855] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:00,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:00,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-30 10:44:00,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347049631] [2025-04-30 10:44:00,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:00,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:00,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:00,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:00,752 INFO L87 Difference]: Start difference. First operand 569 states and 875 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:00,786 INFO L93 Difference]: Finished difference Result 571 states and 851 transitions. [2025-04-30 10:44:00,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:00,786 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 16 [2025-04-30 10:44:00,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:00,788 INFO L225 Difference]: With dead ends: 571 [2025-04-30 10:44:00,788 INFO L226 Difference]: Without dead ends: 571 [2025-04-30 10:44:00,788 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:00,789 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 148 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:00,789 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 304 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-04-30 10:44:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 561. [2025-04-30 10:44:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 545 states have (on average 1.5541284403669724) internal successors, (847), 560 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 847 transitions. [2025-04-30 10:44:00,798 INFO L79 Accepts]: Start accepts. Automaton has 561 states and 847 transitions. Word has length 16 [2025-04-30 10:44:00,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:00,798 INFO L485 AbstractCegarLoop]: Abstraction has 561 states and 847 transitions. [2025-04-30 10:44:00,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:00,798 INFO L278 IsEmpty]: Start isEmpty. Operand 561 states and 847 transitions. [2025-04-30 10:44:00,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:44:00,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:00,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:00,806 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-04-30 10:44:01,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-30 10:44:01,003 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:01,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 933583904, now seen corresponding path program 1 times [2025-04-30 10:44:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:01,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077064498] [2025-04-30 10:44:01,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:01,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:44:01,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:44:01,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:01,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:01,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:01,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077064498] [2025-04-30 10:44:01,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077064498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:01,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714800202] [2025-04-30 10:44:01,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:01,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:01,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:01,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:01,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:44:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:44:01,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:44:01,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:01,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:01,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:44:01,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:01,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:01,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714800202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:01,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:01,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-30 10:44:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354221802] [2025-04-30 10:44:01,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:01,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:01,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:01,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:01,164 INFO L87 Difference]: Start difference. First operand 561 states and 847 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:01,217 INFO L93 Difference]: Finished difference Result 883 states and 1279 transitions. [2025-04-30 10:44:01,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:01,218 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:44:01,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:01,220 INFO L225 Difference]: With dead ends: 883 [2025-04-30 10:44:01,220 INFO L226 Difference]: Without dead ends: 883 [2025-04-30 10:44:01,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:01,220 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 131 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:01,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 392 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-04-30 10:44:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 809. [2025-04-30 10:44:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 793 states have (on average 1.514501891551072) internal successors, (1201), 808 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1201 transitions. [2025-04-30 10:44:01,232 INFO L79 Accepts]: Start accepts. Automaton has 809 states and 1201 transitions. Word has length 18 [2025-04-30 10:44:01,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:01,232 INFO L485 AbstractCegarLoop]: Abstraction has 809 states and 1201 transitions. [2025-04-30 10:44:01,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,233 INFO L278 IsEmpty]: Start isEmpty. Operand 809 states and 1201 transitions. [2025-04-30 10:44:01,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:01,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:01,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:01,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:44:01,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:44:01,438 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:01,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash -644832843, now seen corresponding path program 1 times [2025-04-30 10:44:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:01,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896310346] [2025-04-30 10:44:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:01,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:01,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:01,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:01,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:44:01,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:01,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896310346] [2025-04-30 10:44:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896310346] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:01,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260851251] [2025-04-30 10:44:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:01,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:01,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:01,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:01,479 INFO L87 Difference]: Start difference. First operand 809 states and 1201 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:01,506 INFO L93 Difference]: Finished difference Result 352 states and 499 transitions. [2025-04-30 10:44:01,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:01,507 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-04-30 10:44:01,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:01,508 INFO L225 Difference]: With dead ends: 352 [2025-04-30 10:44:01,508 INFO L226 Difference]: Without dead ends: 352 [2025-04-30 10:44:01,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:01,509 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 45 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:01,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 173 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-30 10:44:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 340. [2025-04-30 10:44:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 328 states have (on average 1.5030487804878048) internal successors, (493), 339 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 493 transitions. [2025-04-30 10:44:01,514 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 493 transitions. Word has length 23 [2025-04-30 10:44:01,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:01,515 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 493 transitions. [2025-04-30 10:44:01,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,515 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 493 transitions. [2025-04-30 10:44:01,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:01,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:01,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:01,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:44:01,517 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:01,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -555651571, now seen corresponding path program 2 times [2025-04-30 10:44:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:01,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550928012] [2025-04-30 10:44:01,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:01,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:44:01,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:01,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:01,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:44:01,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:01,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550928012] [2025-04-30 10:44:01,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550928012] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:01,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770545810] [2025-04-30 10:44:01,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:01,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:01,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:01,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:44:01,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:44:01,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:01,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:01,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:01,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:44:01,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:01,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770545810] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:01,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2025-04-30 10:44:01,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15060179] [2025-04-30 10:44:01,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:01,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:01,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:01,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:01,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:01,742 INFO L87 Difference]: Start difference. First operand 340 states and 493 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:01,832 INFO L93 Difference]: Finished difference Result 388 states and 535 transitions. [2025-04-30 10:44:01,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:01,833 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-30 10:44:01,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:01,834 INFO L225 Difference]: With dead ends: 388 [2025-04-30 10:44:01,834 INFO L226 Difference]: Without dead ends: 388 [2025-04-30 10:44:01,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:44:01,835 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 285 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:01,835 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 375 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-04-30 10:44:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 340. [2025-04-30 10:44:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 328 states have (on average 1.4664634146341464) internal successors, (481), 339 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 481 transitions. [2025-04-30 10:44:01,841 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 481 transitions. Word has length 25 [2025-04-30 10:44:01,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:01,841 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 481 transitions. [2025-04-30 10:44:01,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:01,841 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 481 transitions. [2025-04-30 10:44:01,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:01,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:01,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:01,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:02,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:02,043 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:02,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1395065772, now seen corresponding path program 1 times [2025-04-30 10:44:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:02,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047624084] [2025-04-30 10:44:02,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:02,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:02,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:02,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:02,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047624084] [2025-04-30 10:44:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047624084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:02,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652581251] [2025-04-30 10:44:02,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:02,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:02,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:02,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:02,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:44:02,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:02,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:02,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:02,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:02,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:44:02,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:02,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:02,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652581251] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:02,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-30 10:44:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479930343] [2025-04-30 10:44:02,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:02,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:02,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:02,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:02,276 INFO L87 Difference]: Start difference. First operand 340 states and 481 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:02,336 INFO L93 Difference]: Finished difference Result 985 states and 1383 transitions. [2025-04-30 10:44:02,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:02,336 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2025-04-30 10:44:02,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:02,339 INFO L225 Difference]: With dead ends: 985 [2025-04-30 10:44:02,339 INFO L226 Difference]: Without dead ends: 985 [2025-04-30 10:44:02,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:02,340 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 177 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:02,340 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 167 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-04-30 10:44:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 856. [2025-04-30 10:44:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 844 states have (on average 1.4537914691943128) internal successors, (1227), 855 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1227 transitions. [2025-04-30 10:44:02,354 INFO L79 Accepts]: Start accepts. Automaton has 856 states and 1227 transitions. Word has length 27 [2025-04-30 10:44:02,354 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:02,355 INFO L485 AbstractCegarLoop]: Abstraction has 856 states and 1227 transitions. [2025-04-30 10:44:02,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:02,355 INFO L278 IsEmpty]: Start isEmpty. Operand 856 states and 1227 transitions. [2025-04-30 10:44:02,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:44:02,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:02,355 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:02,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:44:02,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:02,556 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:02,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1359367982, now seen corresponding path program 1 times [2025-04-30 10:44:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:02,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422039553] [2025-04-30 10:44:02,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:02,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:02,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:02,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:02,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:02,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422039553] [2025-04-30 10:44:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422039553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:02,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174665499] [2025-04-30 10:44:02,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:02,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:02,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:44:02,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:02,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:02,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:44:02,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:02,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174665499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:02,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:44:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936173764] [2025-04-30 10:44:02,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:02,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:02,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:02,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:02,787 INFO L87 Difference]: Start difference. First operand 856 states and 1227 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:02,892 INFO L93 Difference]: Finished difference Result 2140 states and 2927 transitions. [2025-04-30 10:44:02,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:44:02,893 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:44:02,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:02,899 INFO L225 Difference]: With dead ends: 2140 [2025-04-30 10:44:02,899 INFO L226 Difference]: Without dead ends: 2140 [2025-04-30 10:44:02,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:44:02,899 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 340 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:02,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 451 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-04-30 10:44:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1972. [2025-04-30 10:44:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1960 states have (on average 1.411734693877551) internal successors, (2767), 1971 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2767 transitions. [2025-04-30 10:44:02,931 INFO L79 Accepts]: Start accepts. Automaton has 1972 states and 2767 transitions. Word has length 28 [2025-04-30 10:44:02,931 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:02,931 INFO L485 AbstractCegarLoop]: Abstraction has 1972 states and 2767 transitions. [2025-04-30 10:44:02,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:02,932 INFO L278 IsEmpty]: Start isEmpty. Operand 1972 states and 2767 transitions. [2025-04-30 10:44:02,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:44:02,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:02,932 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:02,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:03,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:44:03,133 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:03,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash 716480828, now seen corresponding path program 1 times [2025-04-30 10:44:03,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863010726] [2025-04-30 10:44:03,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:44:03,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:44:03,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:44:03,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863010726] [2025-04-30 10:44:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863010726] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:03,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186080178] [2025-04-30 10:44:03,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:03,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:03,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:03,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:44:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:44:03,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:44:03,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:44:03,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:44:03,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:44:03,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186080178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:03,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:03,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-30 10:44:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361835682] [2025-04-30 10:44:03,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:03,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:03,277 INFO L87 Difference]: Start difference. First operand 1972 states and 2767 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,324 INFO L93 Difference]: Finished difference Result 989 states and 1340 transitions. [2025-04-30 10:44:03,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:03,325 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-30 10:44:03,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,327 INFO L225 Difference]: With dead ends: 989 [2025-04-30 10:44:03,327 INFO L226 Difference]: Without dead ends: 989 [2025-04-30 10:44:03,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:03,328 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:03,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 427 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-04-30 10:44:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 931. [2025-04-30 10:44:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 919 states have (on average 1.3841131664853101) internal successors, (1272), 930 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1272 transitions. [2025-04-30 10:44:03,341 INFO L79 Accepts]: Start accepts. Automaton has 931 states and 1272 transitions. Word has length 30 [2025-04-30 10:44:03,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,342 INFO L485 AbstractCegarLoop]: Abstraction has 931 states and 1272 transitions. [2025-04-30 10:44:03,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:03,342 INFO L278 IsEmpty]: Start isEmpty. Operand 931 states and 1272 transitions. [2025-04-30 10:44:03,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:44:03,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,343 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:03,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:03,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:44:03,543 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:03,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1293143655, now seen corresponding path program 1 times [2025-04-30 10:44:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348359083] [2025-04-30 10:44:03,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:44:03,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:44:03,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-04-30 10:44:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348359083] [2025-04-30 10:44:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348359083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:03,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776074753] [2025-04-30 10:44:03,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:03,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:03,682 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:03,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:44:03,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:44:03,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:44:03,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:44:03,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:03,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776074753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:03,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2025-04-30 10:44:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381280400] [2025-04-30 10:44:03,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:44:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:44:03,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:03,931 INFO L87 Difference]: Start difference. First operand 931 states and 1272 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,147 INFO L93 Difference]: Finished difference Result 1744 states and 2306 transitions. [2025-04-30 10:44:04,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:44:04,148 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-04-30 10:44:04,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,161 INFO L225 Difference]: With dead ends: 1744 [2025-04-30 10:44:04,161 INFO L226 Difference]: Without dead ends: 1744 [2025-04-30 10:44:04,161 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:44:04,162 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 339 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:04,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 869 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2025-04-30 10:44:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1039. [2025-04-30 10:44:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1027 states have (on average 1.3982473222979552) internal successors, (1436), 1038 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1436 transitions. [2025-04-30 10:44:04,176 INFO L79 Accepts]: Start accepts. Automaton has 1039 states and 1436 transitions. Word has length 55 [2025-04-30 10:44:04,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,176 INFO L485 AbstractCegarLoop]: Abstraction has 1039 states and 1436 transitions. [2025-04-30 10:44:04,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:04,177 INFO L278 IsEmpty]: Start isEmpty. Operand 1039 states and 1436 transitions. [2025-04-30 10:44:04,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:44:04,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,177 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:44:04,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:04,378 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:04,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1376537936, now seen corresponding path program 1 times [2025-04-30 10:44:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116168691] [2025-04-30 10:44:04,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:44:04,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:44:04,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-30 10:44:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:04,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116168691] [2025-04-30 10:44:04,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116168691] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:04,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062737488] [2025-04-30 10:44:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:04,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:04,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:44:04,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:44:04,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:44:04,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:44:04,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:44:04,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:44:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062737488] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:04,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-04-30 10:44:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715472265] [2025-04-30 10:44:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:04,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:04,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:04,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:04,641 INFO L87 Difference]: Start difference. First operand 1039 states and 1436 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-04-30 10:44:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,715 INFO L93 Difference]: Finished difference Result 1783 states and 2407 transitions. [2025-04-30 10:44:04,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:04,716 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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) Word has length 64 [2025-04-30 10:44:04,717 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,721 INFO L225 Difference]: With dead ends: 1783 [2025-04-30 10:44:04,721 INFO L226 Difference]: Without dead ends: 1783 [2025-04-30 10:44:04,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:44:04,722 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 137 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:04,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 259 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-04-30 10:44:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1723. [2025-04-30 10:44:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1711 states have (on average 1.375219170075979) internal successors, (2353), 1722 states have internal predecessors, (2353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2353 transitions. [2025-04-30 10:44:04,753 INFO L79 Accepts]: Start accepts. Automaton has 1723 states and 2353 transitions. Word has length 64 [2025-04-30 10:44:04,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,753 INFO L485 AbstractCegarLoop]: Abstraction has 1723 states and 2353 transitions. [2025-04-30 10:44:04,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-04-30 10:44:04,753 INFO L278 IsEmpty]: Start isEmpty. Operand 1723 states and 2353 transitions. [2025-04-30 10:44:04,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:44:04,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,755 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:04,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:44:04,960 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:04,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash -551888133, now seen corresponding path program 1 times [2025-04-30 10:44:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901431530] [2025-04-30 10:44:04,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:44:04,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:44:04,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 33 proven. 60 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-30 10:44:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:05,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901431530] [2025-04-30 10:44:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901431530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:05,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722029923] [2025-04-30 10:44:05,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:05,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:05,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:05,043 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:05,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:44:05,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:44:05,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:44:05,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:05,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:44:05,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-04-30 10:44:05,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-04-30 10:44:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722029923] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:05,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2025-04-30 10:44:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034207002] [2025-04-30 10:44:05,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:05,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:05,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:05,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:05,197 INFO L87 Difference]: Start difference. First operand 1723 states and 2353 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:06,073 INFO L93 Difference]: Finished difference Result 7034 states and 9487 transitions. [2025-04-30 10:44:06,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-30 10:44:06,074 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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 66 [2025-04-30 10:44:06,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:06,093 INFO L225 Difference]: With dead ends: 7034 [2025-04-30 10:44:06,093 INFO L226 Difference]: Without dead ends: 7034 [2025-04-30 10:44:06,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2025-04-30 10:44:06,094 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 654 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:06,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 671 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2025-04-30 10:44:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 4878. [2025-04-30 10:44:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4867 states have (on average 1.3977809739058968) internal successors, (6803), 4877 states have internal predecessors, (6803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6803 transitions. [2025-04-30 10:44:06,196 INFO L79 Accepts]: Start accepts. Automaton has 4878 states and 6803 transitions. Word has length 66 [2025-04-30 10:44:06,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:06,196 INFO L485 AbstractCegarLoop]: Abstraction has 4878 states and 6803 transitions. [2025-04-30 10:44:06,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:06,196 INFO L278 IsEmpty]: Start isEmpty. Operand 4878 states and 6803 transitions. [2025-04-30 10:44:06,197 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-30 10:44:06,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:06,198 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:06,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:06,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:06,402 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:06,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash -39001296, now seen corresponding path program 1 times [2025-04-30 10:44:06,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:06,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240820797] [2025-04-30 10:44:06,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:06,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:44:06,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:44:06,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:06,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-30 10:44:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:06,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240820797] [2025-04-30 10:44:06,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240820797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:06,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479891726] [2025-04-30 10:44:06,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:06,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:06,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:06,527 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:06,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:44:06,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:44:06,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:44:06,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:06,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:06,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:44:06,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 113 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:44:06,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 115 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:44:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479891726] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:06,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-04-30 10:44:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120600974] [2025-04-30 10:44:06,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:06,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:06,763 INFO L87 Difference]: Start difference. First operand 4878 states and 6803 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:07,171 INFO L93 Difference]: Finished difference Result 7698 states and 10403 transitions. [2025-04-30 10:44:07,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-30 10:44:07,171 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-04-30 10:44:07,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:07,193 INFO L225 Difference]: With dead ends: 7698 [2025-04-30 10:44:07,194 INFO L226 Difference]: Without dead ends: 7698 [2025-04-30 10:44:07,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:44:07,194 INFO L437 NwaCegarLoop]: 127 mSDtfsCounter, 249 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:07,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1089 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7698 states. [2025-04-30 10:44:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7698 to 4676. [2025-04-30 10:44:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4676 states, 4665 states have (on average 1.3736334405144695) internal successors, (6408), 4675 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 6408 transitions. [2025-04-30 10:44:07,293 INFO L79 Accepts]: Start accepts. Automaton has 4676 states and 6408 transitions. Word has length 68 [2025-04-30 10:44:07,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:07,293 INFO L485 AbstractCegarLoop]: Abstraction has 4676 states and 6408 transitions. [2025-04-30 10:44:07,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,293 INFO L278 IsEmpty]: Start isEmpty. Operand 4676 states and 6408 transitions. [2025-04-30 10:44:07,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-30 10:44:07,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:07,294 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:07,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:07,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:07,495 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:07,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1825876446, now seen corresponding path program 1 times [2025-04-30 10:44:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:07,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730850666] [2025-04-30 10:44:07,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:44:07,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:44:07,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-30 10:44:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730850666] [2025-04-30 10:44:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730850666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:07,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320059368] [2025-04-30 10:44:07,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:07,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:07,575 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:07,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:44:07,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:44:07,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:44:07,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:44:07,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-30 10:44:07,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-30 10:44:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320059368] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:07,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-30 10:44:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138150818] [2025-04-30 10:44:07,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:07,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:07,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:07,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:07,764 INFO L87 Difference]: Start difference. First operand 4676 states and 6408 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:07,825 INFO L93 Difference]: Finished difference Result 4674 states and 6379 transitions. [2025-04-30 10:44:07,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:07,826 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-04-30 10:44:07,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:07,832 INFO L225 Difference]: With dead ends: 4674 [2025-04-30 10:44:07,833 INFO L226 Difference]: Without dead ends: 4674 [2025-04-30 10:44:07,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:07,833 INFO L437 NwaCegarLoop]: 96 mSDtfsCounter, 109 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:07,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 264 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2025-04-30 10:44:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4665. [2025-04-30 10:44:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4665 states, 4654 states have (on average 1.3697894284486463) internal successors, (6375), 4664 states have internal predecessors, (6375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6375 transitions. [2025-04-30 10:44:07,876 INFO L79 Accepts]: Start accepts. Automaton has 4665 states and 6375 transitions. Word has length 69 [2025-04-30 10:44:07,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:07,876 INFO L485 AbstractCegarLoop]: Abstraction has 4665 states and 6375 transitions. [2025-04-30 10:44:07,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,876 INFO L278 IsEmpty]: Start isEmpty. Operand 4665 states and 6375 transitions. [2025-04-30 10:44:07,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-30 10:44:07,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:07,877 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:07,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:44:08,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:44:08,078 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:08,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 774388252, now seen corresponding path program 1 times [2025-04-30 10:44:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:08,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258431212] [2025-04-30 10:44:08,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:08,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:44:08,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:44:08,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-30 10:44:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:08,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258431212] [2025-04-30 10:44:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258431212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:08,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079959212] [2025-04-30 10:44:08,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:08,180 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:08,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:44:08,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:44:08,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:44:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:44:08,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 106 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:44:08,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 108 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:44:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079959212] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:08,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2025-04-30 10:44:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37596191] [2025-04-30 10:44:08,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:08,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:08,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:08,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:08,373 INFO L87 Difference]: Start difference. First operand 4665 states and 6375 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:08,521 INFO L93 Difference]: Finished difference Result 4960 states and 6712 transitions. [2025-04-30 10:44:08,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:44:08,524 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-04-30 10:44:08,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:08,537 INFO L225 Difference]: With dead ends: 4960 [2025-04-30 10:44:08,537 INFO L226 Difference]: Without dead ends: 4960 [2025-04-30 10:44:08,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:44:08,539 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 129 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:08,539 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 766 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2025-04-30 10:44:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4176. [2025-04-30 10:44:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4165 states have (on average 1.3793517406962785) internal successors, (5745), 4175 states have internal predecessors, (5745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5745 transitions. [2025-04-30 10:44:08,589 INFO L79 Accepts]: Start accepts. Automaton has 4176 states and 5745 transitions. Word has length 70 [2025-04-30 10:44:08,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:08,589 INFO L485 AbstractCegarLoop]: Abstraction has 4176 states and 5745 transitions. [2025-04-30 10:44:08,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,589 INFO L278 IsEmpty]: Start isEmpty. Operand 4176 states and 5745 transitions. [2025-04-30 10:44:08,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-30 10:44:08,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:08,590 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:08,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:44:08,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:44:08,791 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:08,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash -885537397, now seen corresponding path program 1 times [2025-04-30 10:44:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:08,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350744944] [2025-04-30 10:44:08,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:08,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:44:08,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:44:08,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:44:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:08,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350744944] [2025-04-30 10:44:08,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350744944] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:08,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655557661] [2025-04-30 10:44:08,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:08,889 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:08,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:44:08,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:44:08,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:44:08,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:44:08,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 64 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:44:09,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 64 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:44:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655557661] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:09,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:09,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-30 10:44:09,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527279238] [2025-04-30 10:44:09,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:09,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:09,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:09,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:09,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:09,079 INFO L87 Difference]: Start difference. First operand 4176 states and 5745 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 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-04-30 10:44:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:09,268 INFO L93 Difference]: Finished difference Result 2646 states and 3347 transitions. [2025-04-30 10:44:09,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:44:09,268 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 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) Word has length 70 [2025-04-30 10:44:09,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:09,272 INFO L225 Difference]: With dead ends: 2646 [2025-04-30 10:44:09,272 INFO L226 Difference]: Without dead ends: 2646 [2025-04-30 10:44:09,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:44:09,273 INFO L437 NwaCegarLoop]: 180 mSDtfsCounter, 304 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:09,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1522 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-04-30 10:44:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2259. [2025-04-30 10:44:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2248 states have (on average 1.2869217081850535) internal successors, (2893), 2258 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 2893 transitions. [2025-04-30 10:44:09,301 INFO L79 Accepts]: Start accepts. Automaton has 2259 states and 2893 transitions. Word has length 70 [2025-04-30 10:44:09,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:09,301 INFO L485 AbstractCegarLoop]: Abstraction has 2259 states and 2893 transitions. [2025-04-30 10:44:09,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 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-04-30 10:44:09,301 INFO L278 IsEmpty]: Start isEmpty. Operand 2259 states and 2893 transitions. [2025-04-30 10:44:09,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-30 10:44:09,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:09,302 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:09,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:09,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-30 10:44:09,503 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:09,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash -844997802, now seen corresponding path program 1 times [2025-04-30 10:44:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:09,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303543243] [2025-04-30 10:44:09,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:09,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:44:09,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:44:09,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:09,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:44:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:09,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303543243] [2025-04-30 10:44:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303543243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:09,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761684665] [2025-04-30 10:44:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:09,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:09,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:09,688 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:09,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:44:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:44:09,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:44:09,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:09,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:09,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:44:09,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:09,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:44:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:44:09,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:44:10,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761684665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:10,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:10,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2025-04-30 10:44:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825216466] [2025-04-30 10:44:10,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:10,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:10,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:10,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:10,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:10,127 INFO L87 Difference]: Start difference. First operand 2259 states and 2893 transitions. Second operand has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:10,326 INFO L93 Difference]: Finished difference Result 4030 states and 5107 transitions. [2025-04-30 10:44:10,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:10,326 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-04-30 10:44:10,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:10,331 INFO L225 Difference]: With dead ends: 4030 [2025-04-30 10:44:10,331 INFO L226 Difference]: Without dead ends: 4030 [2025-04-30 10:44:10,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:44:10,332 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 481 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:10,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 454 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2025-04-30 10:44:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 3269. [2025-04-30 10:44:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 3258 states have (on average 1.2992633517495396) internal successors, (4233), 3268 states have internal predecessors, (4233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4233 transitions. [2025-04-30 10:44:10,356 INFO L79 Accepts]: Start accepts. Automaton has 3269 states and 4233 transitions. Word has length 77 [2025-04-30 10:44:10,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:10,356 INFO L485 AbstractCegarLoop]: Abstraction has 3269 states and 4233 transitions. [2025-04-30 10:44:10,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:10,356 INFO L278 IsEmpty]: Start isEmpty. Operand 3269 states and 4233 transitions. [2025-04-30 10:44:10,357 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-04-30 10:44:10,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:10,357 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:10,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:10,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:10,561 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:10,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 172166538, now seen corresponding path program 1 times [2025-04-30 10:44:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:10,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033690119] [2025-04-30 10:44:10,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:10,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-30 10:44:10,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-30 10:44:10,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:10,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-04-30 10:44:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:10,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033690119] [2025-04-30 10:44:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033690119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:10,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479988953] [2025-04-30 10:44:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:10,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:10,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:10,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:10,662 INFO L87 Difference]: Start difference. First operand 3269 states and 4233 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:10,747 INFO L93 Difference]: Finished difference Result 5153 states and 6725 transitions. [2025-04-30 10:44:10,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:10,748 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 96 [2025-04-30 10:44:10,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:10,755 INFO L225 Difference]: With dead ends: 5153 [2025-04-30 10:44:10,755 INFO L226 Difference]: Without dead ends: 5153 [2025-04-30 10:44:10,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:10,755 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 97 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:10,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 305 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2025-04-30 10:44:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 3419. [2025-04-30 10:44:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3408 states have (on average 1.3036971830985915) internal successors, (4443), 3418 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 4443 transitions. [2025-04-30 10:44:10,811 INFO L79 Accepts]: Start accepts. Automaton has 3419 states and 4443 transitions. Word has length 96 [2025-04-30 10:44:10,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:10,811 INFO L485 AbstractCegarLoop]: Abstraction has 3419 states and 4443 transitions. [2025-04-30 10:44:10,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:10,812 INFO L278 IsEmpty]: Start isEmpty. Operand 3419 states and 4443 transitions. [2025-04-30 10:44:10,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-04-30 10:44:10,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:10,813 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:10,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:44:10,813 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:10,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2133626144, now seen corresponding path program 1 times [2025-04-30 10:44:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:10,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387176277] [2025-04-30 10:44:10,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:10,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:44:10,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:44:10,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:10,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 83 proven. 172 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-30 10:44:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:10,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387176277] [2025-04-30 10:44:10,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387176277] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:10,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040863881] [2025-04-30 10:44:10,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:10,907 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:10,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:44:10,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:44:11,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:44:11,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:11,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:11,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:44:11,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-04-30 10:44:11,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:11,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040863881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:11,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:11,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-04-30 10:44:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057250484] [2025-04-30 10:44:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:11,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:11,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:11,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:11,062 INFO L87 Difference]: Start difference. First operand 3419 states and 4443 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:11,080 INFO L93 Difference]: Finished difference Result 3807 states and 4815 transitions. [2025-04-30 10:44:11,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:11,081 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 105 [2025-04-30 10:44:11,081 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:11,086 INFO L225 Difference]: With dead ends: 3807 [2025-04-30 10:44:11,086 INFO L226 Difference]: Without dead ends: 3807 [2025-04-30 10:44:11,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:11,087 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 53 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:11,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 135 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2025-04-30 10:44:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3455. [2025-04-30 10:44:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3455 states, 3444 states have (on average 1.2819396051103369) internal successors, (4415), 3454 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4415 transitions. [2025-04-30 10:44:11,115 INFO L79 Accepts]: Start accepts. Automaton has 3455 states and 4415 transitions. Word has length 105 [2025-04-30 10:44:11,115 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:11,115 INFO L485 AbstractCegarLoop]: Abstraction has 3455 states and 4415 transitions. [2025-04-30 10:44:11,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:11,116 INFO L278 IsEmpty]: Start isEmpty. Operand 3455 states and 4415 transitions. [2025-04-30 10:44:11,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-04-30 10:44:11,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:11,117 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:11,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:11,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:44:11,318 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:11,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1139866219, now seen corresponding path program 1 times [2025-04-30 10:44:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:11,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006438600] [2025-04-30 10:44:11,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:11,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-30 10:44:11,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-30 10:44:11,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:11,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 88 proven. 3 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-04-30 10:44:11,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:11,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006438600] [2025-04-30 10:44:11,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006438600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:11,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197393966] [2025-04-30 10:44:11,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:11,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:11,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:11,417 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:11,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:44:11,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-30 10:44:11,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-30 10:44:11,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:11,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:11,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:44:11,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 82 proven. 80 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-04-30 10:44:11,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 82 proven. 80 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-04-30 10:44:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197393966] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:11,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-30 10:44:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799072431] [2025-04-30 10:44:11,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:11,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:11,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:11,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:11,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:11,689 INFO L87 Difference]: Start difference. First operand 3455 states and 4415 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:11,844 INFO L93 Difference]: Finished difference Result 3141 states and 3731 transitions. [2025-04-30 10:44:11,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:44:11,844 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-04-30 10:44:11,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:11,847 INFO L225 Difference]: With dead ends: 3141 [2025-04-30 10:44:11,847 INFO L226 Difference]: Without dead ends: 3141 [2025-04-30 10:44:11,847 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:44:11,850 INFO L437 NwaCegarLoop]: 167 mSDtfsCounter, 174 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:11,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1314 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2025-04-30 10:44:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2343. [2025-04-30 10:44:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2333 states have (on average 1.2087441063009001) internal successors, (2820), 2342 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 2820 transitions. [2025-04-30 10:44:11,874 INFO L79 Accepts]: Start accepts. Automaton has 2343 states and 2820 transitions. Word has length 107 [2025-04-30 10:44:11,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:11,874 INFO L485 AbstractCegarLoop]: Abstraction has 2343 states and 2820 transitions. [2025-04-30 10:44:11,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:11,875 INFO L278 IsEmpty]: Start isEmpty. Operand 2343 states and 2820 transitions. [2025-04-30 10:44:11,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-04-30 10:44:11,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:11,876 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:11,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:44:12,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:44:12,081 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:12,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1453372266, now seen corresponding path program 1 times [2025-04-30 10:44:12,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:12,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92871953] [2025-04-30 10:44:12,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:12,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:44:12,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:44:12,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 244 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-04-30 10:44:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:12,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92871953] [2025-04-30 10:44:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92871953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:12,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004207878] [2025-04-30 10:44:12,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:12,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:12,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:12,193 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:12,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:44:12,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:44:12,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:44:12,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:12,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:12,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:44:12,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 157 proven. 12 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-04-30 10:44:12,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 157 proven. 12 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-04-30 10:44:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004207878] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:12,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:12,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-04-30 10:44:12,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545499989] [2025-04-30 10:44:12,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:12,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:12,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:12,539 INFO L87 Difference]: Start difference. First operand 2343 states and 2820 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:13,202 INFO L93 Difference]: Finished difference Result 6187 states and 7348 transitions. [2025-04-30 10:44:13,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-30 10:44:13,202 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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 122 [2025-04-30 10:44:13,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:13,209 INFO L225 Difference]: With dead ends: 6187 [2025-04-30 10:44:13,209 INFO L226 Difference]: Without dead ends: 6187 [2025-04-30 10:44:13,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=446, Invalid=1360, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:44:13,210 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 1500 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:13,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 814 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2025-04-30 10:44:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 2344. [2025-04-30 10:44:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2334 states have (on average 1.2086546700942589) internal successors, (2821), 2343 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 2821 transitions. [2025-04-30 10:44:13,243 INFO L79 Accepts]: Start accepts. Automaton has 2344 states and 2821 transitions. Word has length 122 [2025-04-30 10:44:13,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:13,243 INFO L485 AbstractCegarLoop]: Abstraction has 2344 states and 2821 transitions. [2025-04-30 10:44:13,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:13,243 INFO L278 IsEmpty]: Start isEmpty. Operand 2344 states and 2821 transitions. [2025-04-30 10:44:13,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-04-30 10:44:13,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:13,245 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:13,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:13,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:44:13,445 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:13,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1453371882, now seen corresponding path program 1 times [2025-04-30 10:44:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:13,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763182735] [2025-04-30 10:44:13,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:13,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:44:13,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:44:13,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:13,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:13,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763182735] [2025-04-30 10:44:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763182735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:13,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187247521] [2025-04-30 10:44:13,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:13,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:13,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:13,562 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:13,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:44:13,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:44:13,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:44:13,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:13,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:13,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:44:13,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:13,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187247521] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:13,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:13,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-30 10:44:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499461993] [2025-04-30 10:44:13,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:13,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:13,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:13,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:13,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:13,872 INFO L87 Difference]: Start difference. First operand 2344 states and 2821 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:14,046 INFO L93 Difference]: Finished difference Result 3309 states and 3929 transitions. [2025-04-30 10:44:14,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:14,046 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-04-30 10:44:14,047 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:14,050 INFO L225 Difference]: With dead ends: 3309 [2025-04-30 10:44:14,050 INFO L226 Difference]: Without dead ends: 3309 [2025-04-30 10:44:14,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:14,050 INFO L437 NwaCegarLoop]: 126 mSDtfsCounter, 309 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:14,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 436 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2025-04-30 10:44:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2344. [2025-04-30 10:44:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2335 states have (on average 1.2085653104925054) internal successors, (2822), 2343 states have internal predecessors, (2822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 2822 transitions. [2025-04-30 10:44:14,069 INFO L79 Accepts]: Start accepts. Automaton has 2344 states and 2822 transitions. Word has length 122 [2025-04-30 10:44:14,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:14,069 INFO L485 AbstractCegarLoop]: Abstraction has 2344 states and 2822 transitions. [2025-04-30 10:44:14,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,070 INFO L278 IsEmpty]: Start isEmpty. Operand 2344 states and 2822 transitions. [2025-04-30 10:44:14,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-04-30 10:44:14,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:14,071 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:14,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-30 10:44:14,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:44:14,272 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:14,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1453371883, now seen corresponding path program 1 times [2025-04-30 10:44:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:14,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213291315] [2025-04-30 10:44:14,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:14,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:44:14,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:44:14,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:14,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:14,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:14,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213291315] [2025-04-30 10:44:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213291315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:14,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211800433] [2025-04-30 10:44:14,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:14,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:14,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:14,500 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:14,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:44:14,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:44:14,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:44:14,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:14,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:14,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:44:14,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:14,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:44:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:14,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:15,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211800433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:15,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:15,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-04-30 10:44:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390920327] [2025-04-30 10:44:15,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:15,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:15,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:15,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:15,184 INFO L87 Difference]: Start difference. First operand 2344 states and 2822 transitions. Second operand has 14 states, 13 states have (on average 14.153846153846153) internal successors, (184), 14 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:15,719 INFO L93 Difference]: Finished difference Result 6776 states and 8089 transitions. [2025-04-30 10:44:15,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:44:15,720 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 14.153846153846153) internal successors, (184), 14 states have internal predecessors, (184), 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 122 [2025-04-30 10:44:15,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:15,726 INFO L225 Difference]: With dead ends: 6776 [2025-04-30 10:44:15,726 INFO L226 Difference]: Without dead ends: 6776 [2025-04-30 10:44:15,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=654, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:44:15,727 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 843 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:15,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1022 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6776 states. [2025-04-30 10:44:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6776 to 2478. [2025-04-30 10:44:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2469 states have (on average 1.2130417172944512) internal successors, (2995), 2477 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 2995 transitions. [2025-04-30 10:44:15,760 INFO L79 Accepts]: Start accepts. Automaton has 2478 states and 2995 transitions. Word has length 122 [2025-04-30 10:44:15,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:15,760 INFO L485 AbstractCegarLoop]: Abstraction has 2478 states and 2995 transitions. [2025-04-30 10:44:15,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 14.153846153846153) internal successors, (184), 14 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:15,761 INFO L278 IsEmpty]: Start isEmpty. Operand 2478 states and 2995 transitions. [2025-04-30 10:44:15,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-04-30 10:44:15,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:15,762 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:15,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:44:15,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:15,963 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:15,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash -163465020, now seen corresponding path program 1 times [2025-04-30 10:44:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:15,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861514130] [2025-04-30 10:44:15,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:15,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-30 10:44:15,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-30 10:44:15,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:15,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:16,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861514130] [2025-04-30 10:44:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861514130] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:16,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54014594] [2025-04-30 10:44:16,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:16,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:16,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:16,114 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:16,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:44:16,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-30 10:44:16,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-30 10:44:16,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:16,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:16,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:44:16,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:16,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54014594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:16,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-30 10:44:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238581989] [2025-04-30 10:44:16,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:16,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:16,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:16,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:16,462 INFO L87 Difference]: Start difference. First operand 2478 states and 2995 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:16,625 INFO L93 Difference]: Finished difference Result 4801 states and 5765 transitions. [2025-04-30 10:44:16,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:44:16,626 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-04-30 10:44:16,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:16,630 INFO L225 Difference]: With dead ends: 4801 [2025-04-30 10:44:16,630 INFO L226 Difference]: Without dead ends: 4801 [2025-04-30 10:44:16,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:16,630 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 539 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:16,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 269 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:16,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states. [2025-04-30 10:44:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 2479. [2025-04-30 10:44:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2470 states have (on average 1.2129554655870445) internal successors, (2996), 2478 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 2996 transitions. [2025-04-30 10:44:16,654 INFO L79 Accepts]: Start accepts. Automaton has 2479 states and 2996 transitions. Word has length 125 [2025-04-30 10:44:16,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:16,654 INFO L485 AbstractCegarLoop]: Abstraction has 2479 states and 2996 transitions. [2025-04-30 10:44:16,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,654 INFO L278 IsEmpty]: Start isEmpty. Operand 2479 states and 2996 transitions. [2025-04-30 10:44:16,656 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-04-30 10:44:16,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:16,656 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:16,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:16,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-30 10:44:16,857 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:16,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 706677679, now seen corresponding path program 1 times [2025-04-30 10:44:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:16,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924506092] [2025-04-30 10:44:16,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:16,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-30 10:44:16,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-30 10:44:16,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:16,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:17,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924506092] [2025-04-30 10:44:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924506092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:17,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235720519] [2025-04-30 10:44:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:17,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:17,047 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:17,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-30 10:44:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-30 10:44:17,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-30 10:44:17,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:17,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:17,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:44:17,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:17,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-30 10:44:17,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:17,439 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_25 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_25) 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| v_~x1~0.base_25 0)))) is different from false [2025-04-30 10:44:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 110 trivial. 58 not checked. [2025-04-30 10:44:17,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235720519] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:17,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:17,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 8 [2025-04-30 10:44:17,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156586532] [2025-04-30 10:44:17,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:17,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:17,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:17,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2025-04-30 10:44:17,458 INFO L87 Difference]: Start difference. First operand 2479 states and 2996 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:17,714 INFO L93 Difference]: Finished difference Result 5551 states and 6660 transitions. [2025-04-30 10:44:17,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:17,715 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-04-30 10:44:17,715 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:17,720 INFO L225 Difference]: With dead ends: 5551 [2025-04-30 10:44:17,720 INFO L226 Difference]: Without dead ends: 5549 [2025-04-30 10:44:17,720 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=201, Unknown=1, NotChecked=30, Total=306 [2025-04-30 10:44:17,721 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 407 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:17,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 699 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 419 Unchecked, 0.2s Time] [2025-04-30 10:44:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2025-04-30 10:44:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 3943. [2025-04-30 10:44:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3934 states have (on average 1.2109811896288765) internal successors, (4764), 3942 states have internal predecessors, (4764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 4764 transitions. [2025-04-30 10:44:17,758 INFO L79 Accepts]: Start accepts. Automaton has 3943 states and 4764 transitions. Word has length 128 [2025-04-30 10:44:17,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:17,758 INFO L485 AbstractCegarLoop]: Abstraction has 3943 states and 4764 transitions. [2025-04-30 10:44:17,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:17,758 INFO L278 IsEmpty]: Start isEmpty. Operand 3943 states and 4764 transitions. [2025-04-30 10:44:17,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-04-30 10:44:17,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:17,760 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:17,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-30 10:44:17,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,961 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:17,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash 706677295, now seen corresponding path program 1 times [2025-04-30 10:44:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:17,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649161081] [2025-04-30 10:44:17,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:17,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-30 10:44:17,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-30 10:44:17,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:17,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 13 proven. 311 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-30 10:44:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:18,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649161081] [2025-04-30 10:44:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649161081] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:18,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507817917] [2025-04-30 10:44:18,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:18,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:18,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:18,791 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:18,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-30 10:44:18,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-30 10:44:18,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-30 10:44:18,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:18,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:18,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:44:18,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:19,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:19,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:19,236 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:19,236 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-30 10:44:19,242 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:19,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-30 10:44:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-04-30 10:44:19,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:19,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-04-30 10:44:19,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-30 10:44:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-04-30 10:44:19,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507817917] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:19,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:19,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 24 [2025-04-30 10:44:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503572057] [2025-04-30 10:44:19,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:44:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:19,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:44:19,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:44:19,682 INFO L87 Difference]: Start difference. First operand 3943 states and 4764 transitions. Second operand has 25 states, 25 states have (on average 6.24) internal successors, (156), 24 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:20,336 INFO L93 Difference]: Finished difference Result 8923 states and 10669 transitions. [2025-04-30 10:44:20,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:44:20,337 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.24) internal successors, (156), 24 states have internal predecessors, (156), 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 128 [2025-04-30 10:44:20,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:20,348 INFO L225 Difference]: With dead ends: 8923 [2025-04-30 10:44:20,348 INFO L226 Difference]: Without dead ends: 8909 [2025-04-30 10:44:20,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:44:20,349 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 806 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:20,349 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1401 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8909 states. [2025-04-30 10:44:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8909 to 5015. [2025-04-30 10:44:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5015 states, 5006 states have (on average 1.2125449460647224) internal successors, (6070), 5014 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 6070 transitions. [2025-04-30 10:44:20,401 INFO L79 Accepts]: Start accepts. Automaton has 5015 states and 6070 transitions. Word has length 128 [2025-04-30 10:44:20,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:20,401 INFO L485 AbstractCegarLoop]: Abstraction has 5015 states and 6070 transitions. [2025-04-30 10:44:20,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.24) internal successors, (156), 24 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,401 INFO L278 IsEmpty]: Start isEmpty. Operand 5015 states and 6070 transitions. [2025-04-30 10:44:20,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-04-30 10:44:20,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:20,403 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 12, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:20,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:20,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:20,604 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:20,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2135446093, now seen corresponding path program 1 times [2025-04-30 10:44:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:20,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909000216] [2025-04-30 10:44:20,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:20,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-04-30 10:44:20,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-04-30 10:44:20,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 99 proven. 373 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:44:21,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:21,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909000216] [2025-04-30 10:44:21,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909000216] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:21,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654110594] [2025-04-30 10:44:21,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:21,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:21,093 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:21,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-30 10:44:21,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-04-30 10:44:21,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-04-30 10:44:21,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-30 10:44:21,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:21,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:21,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 82 proven. 346 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-30 10:44:21,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 82 proven. 346 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-30 10:44:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654110594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:21,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2025-04-30 10:44:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900672634] [2025-04-30 10:44:21,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:21,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:44:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:21,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:44:21,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:44:21,768 INFO L87 Difference]: Start difference. First operand 5015 states and 6070 transitions. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 18 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,769 INFO L93 Difference]: Finished difference Result 46635 states and 54526 transitions. [2025-04-30 10:44:24,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-04-30 10:44:24,770 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 18 states have internal predecessors, (195), 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 130 [2025-04-30 10:44:24,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,825 INFO L225 Difference]: With dead ends: 46635 [2025-04-30 10:44:24,825 INFO L226 Difference]: Without dead ends: 46635 [2025-04-30 10:44:24,829 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8750 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2467, Invalid=19585, Unknown=0, NotChecked=0, Total=22052 [2025-04-30 10:44:24,830 INFO L437 NwaCegarLoop]: 217 mSDtfsCounter, 2934 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2934 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,830 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2934 Valid, 3315 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:44:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46635 states. [2025-04-30 10:44:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46635 to 20603. [2025-04-30 10:44:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20603 states, 20594 states have (on average 1.2058366514518792) internal successors, (24833), 20602 states have internal predecessors, (24833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20603 states to 20603 states and 24833 transitions. [2025-04-30 10:44:25,140 INFO L79 Accepts]: Start accepts. Automaton has 20603 states and 24833 transitions. Word has length 130 [2025-04-30 10:44:25,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,140 INFO L485 AbstractCegarLoop]: Abstraction has 20603 states and 24833 transitions. [2025-04-30 10:44:25,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 18 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,140 INFO L278 IsEmpty]: Start isEmpty. Operand 20603 states and 24833 transitions. [2025-04-30 10:44:25,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-04-30 10:44:25,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,146 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-30 10:44:25,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:25,347 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:25,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1561699120, now seen corresponding path program 1 times [2025-04-30 10:44:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180905067] [2025-04-30 10:44:25,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-04-30 10:44:25,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-04-30 10:44:25,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 400 proven. 4 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-04-30 10:44:25,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180905067] [2025-04-30 10:44:25,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180905067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:25,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204242370] [2025-04-30 10:44:25,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:25,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:25,462 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:25,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-30 10:44:25,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-04-30 10:44:25,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-04-30 10:44:25,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:44:25,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 400 proven. 4 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-04-30 10:44:25,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-04-30 10:44:25,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204242370] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:25,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:25,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2025-04-30 10:44:25,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778098059] [2025-04-30 10:44:25,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:25,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:25,656 INFO L87 Difference]: Start difference. First operand 20603 states and 24833 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,747 INFO L93 Difference]: Finished difference Result 10352 states and 12360 transitions. [2025-04-30 10:44:25,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:25,747 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 162 [2025-04-30 10:44:25,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,758 INFO L225 Difference]: With dead ends: 10352 [2025-04-30 10:44:25,758 INFO L226 Difference]: Without dead ends: 10352 [2025-04-30 10:44:25,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:25,758 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 104 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 271 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10352 states. [2025-04-30 10:44:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10352 to 9723. [2025-04-30 10:44:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9723 states, 9714 states have (on average 1.198888202594194) internal successors, (11646), 9722 states have internal predecessors, (11646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9723 states to 9723 states and 11646 transitions. [2025-04-30 10:44:25,833 INFO L79 Accepts]: Start accepts. Automaton has 9723 states and 11646 transitions. Word has length 162 [2025-04-30 10:44:25,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,833 INFO L485 AbstractCegarLoop]: Abstraction has 9723 states and 11646 transitions. [2025-04-30 10:44:25,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:25,833 INFO L278 IsEmpty]: Start isEmpty. Operand 9723 states and 11646 transitions. [2025-04-30 10:44:25,837 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-04-30 10:44:25,837 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,837 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 14, 9, 9, 7, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:26,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:26,038 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:26,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash 307783036, now seen corresponding path program 2 times [2025-04-30 10:44:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838972246] [2025-04-30 10:44:26,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-04-30 10:44:26,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-04-30 10:44:26,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:26,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 395 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-04-30 10:44:26,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838972246] [2025-04-30 10:44:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838972246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:26,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014245129] [2025-04-30 10:44:26,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:26,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:26,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:26,174 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:26,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-30 10:44:26,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-04-30 10:44:26,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-04-30 10:44:26,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:26,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:44:26,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 341 proven. 133 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-04-30 10:44:26,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 341 proven. 133 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-04-30 10:44:26,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014245129] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:26,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:26,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-30 10:44:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256970965] [2025-04-30 10:44:26,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:44:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:44:26,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:26,524 INFO L87 Difference]: Start difference. First operand 9723 states and 11646 transitions. Second operand has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,665 INFO L93 Difference]: Finished difference Result 9152 states and 10453 transitions. [2025-04-30 10:44:26,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:44:26,665 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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 170 [2025-04-30 10:44:26,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,671 INFO L225 Difference]: With dead ends: 9152 [2025-04-30 10:44:26,671 INFO L226 Difference]: Without dead ends: 9152 [2025-04-30 10:44:26,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:44:26,671 INFO L437 NwaCegarLoop]: 179 mSDtfsCounter, 169 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1596 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9152 states. [2025-04-30 10:44:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9152 to 8211. [2025-04-30 10:44:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8211 states, 8202 states have (on average 1.1511826383808828) internal successors, (9442), 8210 states have internal predecessors, (9442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 9442 transitions. [2025-04-30 10:44:26,751 INFO L79 Accepts]: Start accepts. Automaton has 8211 states and 9442 transitions. Word has length 170 [2025-04-30 10:44:26,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,752 INFO L485 AbstractCegarLoop]: Abstraction has 8211 states and 9442 transitions. [2025-04-30 10:44:26,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:26,752 INFO L278 IsEmpty]: Start isEmpty. Operand 8211 states and 9442 transitions. [2025-04-30 10:44:26,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-04-30 10:44:26,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,755 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:26,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:26,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-30 10:44:26,956 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:26,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2108426156, now seen corresponding path program 1 times [2025-04-30 10:44:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128998223] [2025-04-30 10:44:26,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-30 10:44:26,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-30 10:44:26,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 12 proven. 939 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:44:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128998223] [2025-04-30 10:44:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128998223] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:28,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282452844] [2025-04-30 10:44:28,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:28,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:28,058 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:28,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-30 10:44:28,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-30 10:44:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-30 10:44:28,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-30 10:44:28,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:28,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:28,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:28,471 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:44:28,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:44:28,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,517 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,654 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 119 proven. 798 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-30 10:44:28,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:28,986 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (forall ((v_ArrVal_1340 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| c_~x1~0.base v_ArrVal_1340) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| c_~x1~0.base v_ArrVal_1341) c_~S~0.base) .cse0) 0)))) is different from false [2025-04-30 10:44:29,430 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:29,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-30 10:44:29,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-04-30 10:44:29,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:44:29,446 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:29,446 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-30 10:44:29,448 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:29,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-30 10:44:29,681 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:29,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-04-30 10:44:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 107 proven. 528 refuted. 0 times theorem prover too weak. 65 trivial. 282 not checked. [2025-04-30 10:44:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282452844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:29,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:29,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 34 [2025-04-30 10:44:29,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112095591] [2025-04-30 10:44:29,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:44:29,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:44:29,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1023, Unknown=1, NotChecked=64, Total=1190 [2025-04-30 10:44:29,712 INFO L87 Difference]: Start difference. First operand 8211 states and 9442 transitions. Second operand has 35 states, 35 states have (on average 10.114285714285714) internal successors, (354), 34 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:39,173 INFO L93 Difference]: Finished difference Result 63204 states and 71499 transitions. [2025-04-30 10:44:39,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2025-04-30 10:44:39,174 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 10.114285714285714) internal successors, (354), 34 states have internal predecessors, (354), 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 180 [2025-04-30 10:44:39,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:39,257 INFO L225 Difference]: With dead ends: 63204 [2025-04-30 10:44:39,257 INFO L226 Difference]: Without dead ends: 63204 [2025-04-30 10:44:39,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 350 SyntacticMatches, 26 SemanticMatches, 264 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31729 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=6332, Invalid=63631, Unknown=1, NotChecked=526, Total=70490 [2025-04-30 10:44:39,264 INFO L437 NwaCegarLoop]: 310 mSDtfsCounter, 6567 mSDsluCounter, 8449 mSDsCounter, 0 mSdLazyCounter, 4208 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6567 SdHoareTripleChecker+Valid, 8759 SdHoareTripleChecker+Invalid, 9780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 4208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5116 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:39,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6567 Valid, 8759 Invalid, 9780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 4208 Invalid, 0 Unknown, 5116 Unchecked, 1.9s Time] [2025-04-30 10:44:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63204 states. [2025-04-30 10:44:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63204 to 25680. [2025-04-30 10:44:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25680 states, 25671 states have (on average 1.1472478672431927) internal successors, (29451), 25679 states have internal predecessors, (29451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25680 states to 25680 states and 29451 transitions. [2025-04-30 10:44:39,752 INFO L79 Accepts]: Start accepts. Automaton has 25680 states and 29451 transitions. Word has length 180 [2025-04-30 10:44:39,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:39,752 INFO L485 AbstractCegarLoop]: Abstraction has 25680 states and 29451 transitions. [2025-04-30 10:44:39,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.114285714285714) internal successors, (354), 34 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:39,752 INFO L278 IsEmpty]: Start isEmpty. Operand 25680 states and 29451 transitions. [2025-04-30 10:44:39,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-04-30 10:44:39,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:39,811 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:39,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-30 10:44:40,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-30 10:44:40,012 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:44:40,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash 69019798, now seen corresponding path program 2 times [2025-04-30 10:44:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:40,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585593844] [2025-04-30 10:44:40,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:40,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-04-30 10:44:40,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-04-30 10:44:40,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:40,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 124 proven. 823 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-30 10:44:42,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:42,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585593844] [2025-04-30 10:44:42,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585593844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:42,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023089461] [2025-04-30 10:44:42,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:42,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:42,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:42,070 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:42,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-30 10:44:42,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-04-30 10:44:42,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-04-30 10:44:42,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:42,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:42,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-30 10:44:42,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:42,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:42,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:42,613 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:44:42,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:44:42,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:42,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:42,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:42,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:42,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:42,718 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:42,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:42,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:44:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 119 proven. 804 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-04-30 10:44:43,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:43,219 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~t4~0.offset 4))) (and (forall ((v_ArrVal_1468 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| c_~x1~0.base v_ArrVal_1468) c_~t4~0.base) .cse0) 0)) (forall ((v_ArrVal_1469 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| c_~x1~0.base v_ArrVal_1469) c_~t4~0.base) .cse0) 0)))) is different from false [2025-04-30 10:44:43,253 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (forall ((v_ArrVal_1468 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| c_~x1~0.base v_ArrVal_1468) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1469 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| c_~x1~0.base v_ArrVal_1469) c_~S~0.base) .cse0) 0)))) is different from false [2025-04-30 10:44:43,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:43,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-30 10:44:43,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-04-30 10:44:43,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:44:43,612 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:43,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-30 10:44:43,614 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:43,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-30 10:44:43,861 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:43,862 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-04-30 10:44:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 107 proven. 453 refuted. 0 times theorem prover too weak. 59 trivial. 363 not checked. [2025-04-30 10:44:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023089461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:43,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:43,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 31 [2025-04-30 10:44:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167694027] [2025-04-30 10:44:43,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:43,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:44:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:43,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:44:43,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=785, Unknown=3, NotChecked=114, Total=992 [2025-04-30 10:44:43,893 INFO L87 Difference]: Start difference. First operand 25680 states and 29451 transitions. Second operand has 32 states, 32 states have (on average 10.5) internal successors, (336), 31 states have internal predecessors, (336), 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) Killed by 15