./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/lockfree-3.1.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.1.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:43:59,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:00,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:44:00,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:00,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:00,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:00,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:00,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:00,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:00,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:00,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:00,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:00,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:00,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:00,057 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:00,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:00,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:00,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:00,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:00,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:00,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:00,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:00,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:00,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:00,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:00,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:00,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:00,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:00,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:00,060 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2025-04-30 10:44:00,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:00,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:00,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:00,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:00,278 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:00,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1.i [2025-04-30 10:44:01,541 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef913d50/1db075fd00224ca3b0b9b5259568e7ed/FLAGdc876fdea [2025-04-30 10:44:01,762 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:01,763 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.1.i [2025-04-30 10:44:01,776 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef913d50/1db075fd00224ca3b0b9b5259568e7ed/FLAGdc876fdea [2025-04-30 10:44:02,542 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef913d50/1db075fd00224ca3b0b9b5259568e7ed [2025-04-30 10:44:02,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:02,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:02,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:02,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:02,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:02,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105898b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02, skipping insertion in model container [2025-04-30 10:44:02,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:02,826 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:02,839 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:02,896 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:02,913 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:02,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02 WrapperNode [2025-04-30 10:44:02,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:02,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:02,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:02,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:02,919 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:44:02" (1/1) ... [2025-04-30 10:44:02,928 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:44:02" (1/1) ... [2025-04-30 10:44:02,947 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2025-04-30 10:44:02,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:02,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:02,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:02,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:02,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,978 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:44:02,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:02,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:02,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:03,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:03,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:03,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (1/1) ... [2025-04-30 10:44:03,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:03,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:03,036 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:44:03,038 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:44:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:44:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:44:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:44:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:03,137 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:03,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:03,323 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:03,323 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:03,334 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:03,334 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:44:03,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:03 BoogieIcfgContainer [2025-04-30 10:44:03,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:03,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:03,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:03,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:03,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:02" (1/3) ... [2025-04-30 10:44:03,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cd4886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:03, skipping insertion in model container [2025-04-30 10:44:03,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:02" (2/3) ... [2025-04-30 10:44:03,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cd4886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:03, skipping insertion in model container [2025-04-30 10:44:03,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:03" (3/3) ... [2025-04-30 10:44:03,342 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2025-04-30 10:44:03,352 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:03,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.1.i that has 1 procedures, 64 locations, 82 edges, 1 initial locations, 2 loop locations, and 20 error locations. [2025-04-30 10:44:03,388 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:03,395 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;@24822b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:03,396 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-30 10:44:03,398 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:44:03,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:44:03,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:44:03,402 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:44:03,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash 28820323, now seen corresponding path program 1 times [2025-04-30 10:44:03,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558391981] [2025-04-30 10:44:03,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:44:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:44:03,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,512 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:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558391981] [2025-04-30 10:44:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558391981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758459150] [2025-04-30 10:44:03,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:44:03,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:44:03,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:03,532 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:44:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,544 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-04-30 10:44:03,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:44:03,545 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:44:03,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,549 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:44:03,549 INFO L226 Difference]: Without dead ends: 62 [2025-04-30 10:44:03,552 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:44:03,553 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:44:03,554 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:44:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-30 10:44:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-30 10:44:03,570 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:44:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-04-30 10:44:03,573 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2025-04-30 10:44:03,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,573 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-30 10:44:03,573 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:44:03,573 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-04-30 10:44:03,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:03,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:03,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:44:03,574 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:44:03,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1805898957, now seen corresponding path program 1 times [2025-04-30 10:44:03,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559588812] [2025-04-30 10:44:03,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:03,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:03,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,614 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:03,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559588812] [2025-04-30 10:44:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559588812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:03,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660293015] [2025-04-30 10:44:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:03,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:03,617 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:44:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,630 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-04-30 10:44:03,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:03,631 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:44:03,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,631 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:44:03,632 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:44:03,634 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:44:03,635 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:44:03,635 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:44:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:44:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-30 10:44:03,640 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:44:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-04-30 10:44:03,641 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2025-04-30 10:44:03,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,642 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-04-30 10:44:03,642 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:44:03,642 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-04-30 10:44:03,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:03,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:03,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:44:03,642 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:44:03,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958539, now seen corresponding path program 1 times [2025-04-30 10:44:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562608422] [2025-04-30 10:44:03,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:03,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,691 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:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562608422] [2025-04-30 10:44:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562608422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612255932] [2025-04-30 10:44:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:03,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:03,693 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:44:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,772 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2025-04-30 10:44:03,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:03,773 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:44:03,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,774 INFO L225 Difference]: With dead ends: 117 [2025-04-30 10:44:03,776 INFO L226 Difference]: Without dead ends: 116 [2025-04-30 10:44:03,776 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:03,777 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:03,777 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.1s Time] [2025-04-30 10:44:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-30 10:44:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2025-04-30 10:44:03,783 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:44:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-04-30 10:44:03,784 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 7 [2025-04-30 10:44:03,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,785 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-04-30 10:44:03,785 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:44:03,785 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-04-30 10:44:03,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:03,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:03,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:44:03,786 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:44:03,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958155, now seen corresponding path program 1 times [2025-04-30 10:44:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080280420] [2025-04-30 10:44:03,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:03,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:03,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,842 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:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080280420] [2025-04-30 10:44:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080280420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433551479] [2025-04-30 10:44:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:03,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:03,844 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:44:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,870 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2025-04-30 10:44:03,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:03,871 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:44:03,871 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,872 INFO L225 Difference]: With dead ends: 178 [2025-04-30 10:44:03,872 INFO L226 Difference]: Without dead ends: 177 [2025-04-30 10:44:03,872 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:03,873 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:44:03,873 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:44:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-30 10:44:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2025-04-30 10:44:03,878 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:44:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 247 transitions. [2025-04-30 10:44:03,879 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 247 transitions. Word has length 7 [2025-04-30 10:44:03,879 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,879 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 247 transitions. [2025-04-30 10:44:03,879 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:44:03,879 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 247 transitions. [2025-04-30 10:44:03,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:03,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:03,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:44:03,880 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:44:03,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash 296297806, now seen corresponding path program 1 times [2025-04-30 10:44:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613598848] [2025-04-30 10:44:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:03,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:03,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,949 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:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613598848] [2025-04-30 10:44:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613598848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244305555] [2025-04-30 10:44:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:03,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:03,953 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:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,990 INFO L93 Difference]: Finished difference Result 159 states and 253 transitions. [2025-04-30 10:44:03,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:03,991 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:03,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,992 INFO L225 Difference]: With dead ends: 159 [2025-04-30 10:44:03,992 INFO L226 Difference]: Without dead ends: 159 [2025-04-30 10:44:03,992 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:03,992 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:03,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-30 10:44:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-04-30 10:44:04,002 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:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 249 transitions. [2025-04-30 10:44:04,003 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 249 transitions. Word has length 9 [2025-04-30 10:44:04,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,003 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 249 transitions. [2025-04-30 10:44:04,004 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:04,004 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 249 transitions. [2025-04-30 10:44:04,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:04,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:44:04,004 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:04,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash 353556108, now seen corresponding path program 1 times [2025-04-30 10:44:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592417173] [2025-04-30 10:44:04,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:04,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,055 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:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:04,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592417173] [2025-04-30 10:44:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592417173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:04,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928703006] [2025-04-30 10:44:04,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:04,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:04,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:04,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:04,056 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:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,124 INFO L93 Difference]: Finished difference Result 233 states and 358 transitions. [2025-04-30 10:44:04,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:04,125 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:04,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,126 INFO L225 Difference]: With dead ends: 233 [2025-04-30 10:44:04,126 INFO L226 Difference]: Without dead ends: 233 [2025-04-30 10:44:04,126 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:04,128 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 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.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:04,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-30 10:44:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 213. [2025-04-30 10:44:04,138 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:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 345 transitions. [2025-04-30 10:44:04,139 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 345 transitions. Word has length 9 [2025-04-30 10:44:04,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,139 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 345 transitions. [2025-04-30 10:44:04,140 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:04,140 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 345 transitions. [2025-04-30 10:44:04,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:04,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:44:04,140 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:04,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 353556109, now seen corresponding path program 1 times [2025-04-30 10:44:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934326460] [2025-04-30 10:44:04,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:04,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:04,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,232 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:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:04,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934326460] [2025-04-30 10:44:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934326460] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:04,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:04,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528381256] [2025-04-30 10:44:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:04,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:04,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:04,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:04,233 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:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,287 INFO L93 Difference]: Finished difference Result 228 states and 349 transitions. [2025-04-30 10:44:04,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:04,288 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:04,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,289 INFO L225 Difference]: With dead ends: 228 [2025-04-30 10:44:04,289 INFO L226 Difference]: Without dead ends: 228 [2025-04-30 10:44:04,289 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:04,289 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:04,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-30 10:44:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2025-04-30 10:44:04,302 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:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 337 transitions. [2025-04-30 10:44:04,303 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 337 transitions. Word has length 9 [2025-04-30 10:44:04,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,303 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 337 transitions. [2025-04-30 10:44:04,303 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:04,303 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 337 transitions. [2025-04-30 10:44:04,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:04,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:44:04,304 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:04,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1924654535, now seen corresponding path program 1 times [2025-04-30 10:44:04,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315011659] [2025-04-30 10:44:04,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:04,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:04,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,357 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:04,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:04,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315011659] [2025-04-30 10:44:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315011659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:04,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:04,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572818229] [2025-04-30 10:44:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:04,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:04,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:04,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:04,359 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:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,399 INFO L93 Difference]: Finished difference Result 392 states and 600 transitions. [2025-04-30 10:44:04,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:04,400 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:04,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,401 INFO L225 Difference]: With dead ends: 392 [2025-04-30 10:44:04,401 INFO L226 Difference]: Without dead ends: 392 [2025-04-30 10:44:04,401 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:04,402 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:04,402 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:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-30 10:44:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2025-04-30 10:44:04,408 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:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 579 transitions. [2025-04-30 10:44:04,410 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 579 transitions. Word has length 10 [2025-04-30 10:44:04,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,410 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 579 transitions. [2025-04-30 10:44:04,410 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:04,410 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 579 transitions. [2025-04-30 10:44:04,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:44:04,410 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:44:04,411 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:04,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash 516607341, now seen corresponding path program 1 times [2025-04-30 10:44:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572255821] [2025-04-30 10:44:04,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:44:04,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:44:04,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,464 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:04,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:04,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572255821] [2025-04-30 10:44:04,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572255821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:04,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:04,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:04,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259436359] [2025-04-30 10:44:04,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:04,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:04,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:04,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:04,465 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:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,491 INFO L93 Difference]: Finished difference Result 588 states and 890 transitions. [2025-04-30 10:44:04,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:04,491 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:04,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,493 INFO L225 Difference]: With dead ends: 588 [2025-04-30 10:44:04,493 INFO L226 Difference]: Without dead ends: 588 [2025-04-30 10:44:04,493 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:04,493 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:04,493 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:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-04-30 10:44:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 569. [2025-04-30 10:44:04,504 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:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 875 transitions. [2025-04-30 10:44:04,506 INFO L79 Accepts]: Start accepts. Automaton has 569 states and 875 transitions. Word has length 11 [2025-04-30 10:44:04,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,506 INFO L485 AbstractCegarLoop]: Abstraction has 569 states and 875 transitions. [2025-04-30 10:44:04,506 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:04,506 INFO L278 IsEmpty]: Start isEmpty. Operand 569 states and 875 transitions. [2025-04-30 10:44:04,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:44:04,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:44:04,506 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:04,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1842808106, now seen corresponding path program 1 times [2025-04-30 10:44:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965435260] [2025-04-30 10:44:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:04,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:04,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,573 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:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:04,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965435260] [2025-04-30 10:44:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965435260] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:04,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343885050] [2025-04-30 10:44:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:04,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:04,576 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:04,577 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:04,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:04,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:04,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:44:04,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:04,678 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:04,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:04,718 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:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343885050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:04,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-30 10:44:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491969757] [2025-04-30 10:44:04,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:04,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:04,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:04,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:04,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:04,720 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:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,755 INFO L93 Difference]: Finished difference Result 571 states and 851 transitions. [2025-04-30 10:44:04,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:04,755 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:04,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,757 INFO L225 Difference]: With dead ends: 571 [2025-04-30 10:44:04,757 INFO L226 Difference]: Without dead ends: 571 [2025-04-30 10:44:04,757 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:04,758 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 97 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 353 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:04,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 353 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:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-04-30 10:44:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 561. [2025-04-30 10:44:04,765 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:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 847 transitions. [2025-04-30 10:44:04,767 INFO L79 Accepts]: Start accepts. Automaton has 561 states and 847 transitions. Word has length 16 [2025-04-30 10:44:04,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,767 INFO L485 AbstractCegarLoop]: Abstraction has 561 states and 847 transitions. [2025-04-30 10:44:04,768 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:04,768 INFO L278 IsEmpty]: Start isEmpty. Operand 561 states and 847 transitions. [2025-04-30 10:44:04,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:44:04,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:04,775 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:04,973 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:04,973 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:04,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 933583904, now seen corresponding path program 1 times [2025-04-30 10:44:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51869355] [2025-04-30 10:44:04,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:44:04,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:44:04,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,031 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:05,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:05,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51869355] [2025-04-30 10:44:05,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51869355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:05,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515772292] [2025-04-30 10:44:05,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:05,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:05,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:05,035 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:05,036 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:05,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:44:05,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:44:05,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:05,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:44:05,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:05,118 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:05,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:05,150 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:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515772292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:05,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-30 10:44:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115748864] [2025-04-30 10:44:05,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:05,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:05,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:05,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:05,151 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:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:05,217 INFO L93 Difference]: Finished difference Result 883 states and 1279 transitions. [2025-04-30 10:44:05,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:05,217 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:05,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:05,220 INFO L225 Difference]: With dead ends: 883 [2025-04-30 10:44:05,220 INFO L226 Difference]: Without dead ends: 883 [2025-04-30 10:44:05,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:05,220 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 170 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:05,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 374 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-04-30 10:44:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 809. [2025-04-30 10:44:05,231 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:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1201 transitions. [2025-04-30 10:44:05,233 INFO L79 Accepts]: Start accepts. Automaton has 809 states and 1201 transitions. Word has length 18 [2025-04-30 10:44:05,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:05,233 INFO L485 AbstractCegarLoop]: Abstraction has 809 states and 1201 transitions. [2025-04-30 10:44:05,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:05,233 INFO L278 IsEmpty]: Start isEmpty. Operand 809 states and 1201 transitions. [2025-04-30 10:44:05,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:05,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:05,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:05,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:05,434 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:05,434 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:05,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash -644832843, now seen corresponding path program 1 times [2025-04-30 10:44:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:05,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527457623] [2025-04-30 10:44:05,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:05,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:05,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:05,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:05,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:05,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,466 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:05,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:05,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527457623] [2025-04-30 10:44:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527457623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:05,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046127862] [2025-04-30 10:44:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:05,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:05,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:05,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:05,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:05,467 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:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:05,489 INFO L93 Difference]: Finished difference Result 352 states and 499 transitions. [2025-04-30 10:44:05,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:05,489 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:05,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:05,490 INFO L225 Difference]: With dead ends: 352 [2025-04-30 10:44:05,490 INFO L226 Difference]: Without dead ends: 352 [2025-04-30 10:44:05,491 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:05,491 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:05,491 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:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-30 10:44:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 340. [2025-04-30 10:44:05,496 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:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 493 transitions. [2025-04-30 10:44:05,498 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 493 transitions. Word has length 23 [2025-04-30 10:44:05,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:05,498 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 493 transitions. [2025-04-30 10:44:05,498 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:05,498 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 493 transitions. [2025-04-30 10:44:05,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:05,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:05,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:05,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:44:05,499 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:05,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -555651571, now seen corresponding path program 2 times [2025-04-30 10:44:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:05,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318659511] [2025-04-30 10:44:05,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:05,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:44:05,508 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:05,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:05,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,595 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:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:05,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318659511] [2025-04-30 10:44:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318659511] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:05,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339534954] [2025-04-30 10:44:05,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:05,598 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:05,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:05,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:44:05,659 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:05,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:05,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:44:05,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:05,700 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:05,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:05,732 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:05,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339534954] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:05,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2025-04-30 10:44:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042162700] [2025-04-30 10:44:05,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:05,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:05,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:05,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:05,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:05,733 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:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:05,829 INFO L93 Difference]: Finished difference Result 388 states and 535 transitions. [2025-04-30 10:44:05,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:05,830 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:05,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:05,831 INFO L225 Difference]: With dead ends: 388 [2025-04-30 10:44:05,831 INFO L226 Difference]: Without dead ends: 388 [2025-04-30 10:44:05,831 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:05,832 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 183 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:05,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 433 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-04-30 10:44:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 340. [2025-04-30 10:44:05,839 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:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 481 transitions. [2025-04-30 10:44:05,840 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 481 transitions. Word has length 25 [2025-04-30 10:44:05,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:05,841 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 481 transitions. [2025-04-30 10:44:05,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:05,842 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 481 transitions. [2025-04-30 10:44:05,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:05,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:05,843 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:05,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:44:06,043 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:06,044 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:06,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1395065772, now seen corresponding path program 1 times [2025-04-30 10:44:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:06,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771408726] [2025-04-30 10:44:06,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:06,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:06,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:06,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:06,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:06,128 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:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:06,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771408726] [2025-04-30 10:44:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771408726] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:06,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431734604] [2025-04-30 10:44:06,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:06,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:06,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:06,132 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:06,134 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:06,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:06,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:06,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:06,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:06,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:44:06,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:06,252 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:06,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:06,307 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:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431734604] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:06,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:06,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-30 10:44:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40029571] [2025-04-30 10:44:06,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:06,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:06,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:06,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:06,309 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:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:06,369 INFO L93 Difference]: Finished difference Result 981 states and 1381 transitions. [2025-04-30 10:44:06,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:06,370 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:06,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:06,372 INFO L225 Difference]: With dead ends: 981 [2025-04-30 10:44:06,372 INFO L226 Difference]: Without dead ends: 981 [2025-04-30 10:44:06,373 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:06,373 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 173 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:06,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 165 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-04-30 10:44:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 856. [2025-04-30 10:44:06,386 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:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1227 transitions. [2025-04-30 10:44:06,389 INFO L79 Accepts]: Start accepts. Automaton has 856 states and 1227 transitions. Word has length 27 [2025-04-30 10:44:06,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:06,389 INFO L485 AbstractCegarLoop]: Abstraction has 856 states and 1227 transitions. [2025-04-30 10:44:06,389 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:06,390 INFO L278 IsEmpty]: Start isEmpty. Operand 856 states and 1227 transitions. [2025-04-30 10:44:06,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:44:06,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:06,390 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:06,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:06,594 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:06,594 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:06,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1359367982, now seen corresponding path program 1 times [2025-04-30 10:44:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:06,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752823052] [2025-04-30 10:44:06,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:06,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:06,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:06,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:06,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:06,675 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:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:06,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752823052] [2025-04-30 10:44:06,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752823052] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:06,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502072080] [2025-04-30 10:44:06,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:06,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:06,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:06,678 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:06,679 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:06,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:06,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:06,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:06,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:06,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:44:06,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:06,768 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:06,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:06,816 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:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502072080] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:06,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:06,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:44:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144131941] [2025-04-30 10:44:06,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:06,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:06,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:06,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:06,818 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:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:06,936 INFO L93 Difference]: Finished difference Result 2140 states and 2927 transitions. [2025-04-30 10:44:06,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:44:06,937 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:06,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:06,943 INFO L225 Difference]: With dead ends: 2140 [2025-04-30 10:44:06,943 INFO L226 Difference]: Without dead ends: 2140 [2025-04-30 10:44:06,943 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:06,944 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 300 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:06,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 425 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-04-30 10:44:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1972. [2025-04-30 10:44:06,974 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:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2767 transitions. [2025-04-30 10:44:06,981 INFO L79 Accepts]: Start accepts. Automaton has 1972 states and 2767 transitions. Word has length 28 [2025-04-30 10:44:06,981 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:06,981 INFO L485 AbstractCegarLoop]: Abstraction has 1972 states and 2767 transitions. [2025-04-30 10:44:06,981 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:06,981 INFO L278 IsEmpty]: Start isEmpty. Operand 1972 states and 2767 transitions. [2025-04-30 10:44:06,982 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:44:06,982 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:06,982 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:06,988 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:07,182 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:07,182 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:07,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:07,183 INFO L85 PathProgramCache]: Analyzing trace with hash 716480828, now seen corresponding path program 1 times [2025-04-30 10:44:07,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:07,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391889170] [2025-04-30 10:44:07,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:44:07,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:44:07,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,258 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:07,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391889170] [2025-04-30 10:44:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391889170] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:07,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585278267] [2025-04-30 10:44:07,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:07,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:07,261 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:07,263 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:07,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:44:07,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:44:07,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:44:07,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:07,337 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:07,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:07,356 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:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585278267] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:07,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:07,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-30 10:44:07,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753072046] [2025-04-30 10:44:07,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:07,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:07,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:07,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:07,358 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:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:07,408 INFO L93 Difference]: Finished difference Result 989 states and 1340 transitions. [2025-04-30 10:44:07,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:07,409 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:07,409 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:07,413 INFO L225 Difference]: With dead ends: 989 [2025-04-30 10:44:07,413 INFO L226 Difference]: Without dead ends: 989 [2025-04-30 10:44:07,413 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:07,414 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:07,414 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:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-04-30 10:44:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 931. [2025-04-30 10:44:07,429 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:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1272 transitions. [2025-04-30 10:44:07,432 INFO L79 Accepts]: Start accepts. Automaton has 931 states and 1272 transitions. Word has length 30 [2025-04-30 10:44:07,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:07,432 INFO L485 AbstractCegarLoop]: Abstraction has 931 states and 1272 transitions. [2025-04-30 10:44:07,432 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:07,432 INFO L278 IsEmpty]: Start isEmpty. Operand 931 states and 1272 transitions. [2025-04-30 10:44:07,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:44:07,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:07,434 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:07,440 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:07,638 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:07,638 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:07,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1293143655, now seen corresponding path program 1 times [2025-04-30 10:44:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:07,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913385201] [2025-04-30 10:44:07,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:44:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:44:07,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,792 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:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913385201] [2025-04-30 10:44:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913385201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:07,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66001161] [2025-04-30 10:44:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:07,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:07,794 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:07,796 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:07,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:44:07,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:44:07,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:44:07,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:07,950 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:07,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:08,033 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:08,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66001161] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:08,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:08,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2025-04-30 10:44:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656094699] [2025-04-30 10:44:08,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:08,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:44:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:08,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:44:08,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:08,036 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:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:08,254 INFO L93 Difference]: Finished difference Result 1744 states and 2306 transitions. [2025-04-30 10:44:08,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:44:08,254 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:08,255 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:08,259 INFO L225 Difference]: With dead ends: 1744 [2025-04-30 10:44:08,259 INFO L226 Difference]: Without dead ends: 1744 [2025-04-30 10:44:08,260 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:08,260 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 438 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:08,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 858 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2025-04-30 10:44:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1039. [2025-04-30 10:44:08,277 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:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1436 transitions. [2025-04-30 10:44:08,280 INFO L79 Accepts]: Start accepts. Automaton has 1039 states and 1436 transitions. Word has length 55 [2025-04-30 10:44:08,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:08,280 INFO L485 AbstractCegarLoop]: Abstraction has 1039 states and 1436 transitions. [2025-04-30 10:44:08,280 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:08,280 INFO L278 IsEmpty]: Start isEmpty. Operand 1039 states and 1436 transitions. [2025-04-30 10:44:08,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:44:08,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:08,281 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:08,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:08,486 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:08,486 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:08,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1376537936, now seen corresponding path program 1 times [2025-04-30 10:44:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:08,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789587838] [2025-04-30 10:44:08,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:08,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:44:08,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:44:08,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,594 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:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:08,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789587838] [2025-04-30 10:44:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789587838] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:08,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429146874] [2025-04-30 10:44:08,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:08,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:08,596 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:08,598 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:08,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:44:08,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:44:08,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:44:08,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:08,715 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:08,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:08,755 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:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429146874] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:08,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-04-30 10:44:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6568141] [2025-04-30 10:44:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:08,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:08,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:08,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:08,757 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:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:08,827 INFO L93 Difference]: Finished difference Result 1783 states and 2407 transitions. [2025-04-30 10:44:08,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:08,827 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:08,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:08,832 INFO L225 Difference]: With dead ends: 1783 [2025-04-30 10:44:08,832 INFO L226 Difference]: Without dead ends: 1783 [2025-04-30 10:44:08,832 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:08,832 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:08,833 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:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-04-30 10:44:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1723. [2025-04-30 10:44:08,851 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:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2353 transitions. [2025-04-30 10:44:08,855 INFO L79 Accepts]: Start accepts. Automaton has 1723 states and 2353 transitions. Word has length 64 [2025-04-30 10:44:08,855 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:08,855 INFO L485 AbstractCegarLoop]: Abstraction has 1723 states and 2353 transitions. [2025-04-30 10:44:08,856 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:08,856 INFO L278 IsEmpty]: Start isEmpty. Operand 1723 states and 2353 transitions. [2025-04-30 10:44:08,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:44:08,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:08,857 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:08,863 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:09,057 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:09,058 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:09,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash -551888133, now seen corresponding path program 1 times [2025-04-30 10:44:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:09,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181655389] [2025-04-30 10:44:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:44:09,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:44:09,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:09,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:09,146 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:09,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:09,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181655389] [2025-04-30 10:44:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181655389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:09,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386847105] [2025-04-30 10:44:09,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:09,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:09,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:09,148 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:09,150 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:09,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:44:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:44:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:09,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:44:09,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:09,270 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:09,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:09,313 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:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386847105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:09,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:09,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2025-04-30 10:44:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500205971] [2025-04-30 10:44:09,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:09,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:09,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:09,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:09,315 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:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:10,170 INFO L93 Difference]: Finished difference Result 7026 states and 9483 transitions. [2025-04-30 10:44:10,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-30 10:44:10,170 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:10,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:10,190 INFO L225 Difference]: With dead ends: 7026 [2025-04-30 10:44:10,190 INFO L226 Difference]: Without dead ends: 7026 [2025-04-30 10:44:10,191 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:10,191 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 442 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:10,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 680 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2025-04-30 10:44:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 4878. [2025-04-30 10:44:10,263 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:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6803 transitions. [2025-04-30 10:44:10,274 INFO L79 Accepts]: Start accepts. Automaton has 4878 states and 6803 transitions. Word has length 66 [2025-04-30 10:44:10,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:10,274 INFO L485 AbstractCegarLoop]: Abstraction has 4878 states and 6803 transitions. [2025-04-30 10:44:10,275 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:10,275 INFO L278 IsEmpty]: Start isEmpty. Operand 4878 states and 6803 transitions. [2025-04-30 10:44:10,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-30 10:44:10,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:10,276 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:10,283 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:10,477 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:10,477 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:10,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -39001296, now seen corresponding path program 1 times [2025-04-30 10:44:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:10,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483848372] [2025-04-30 10:44:10,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:10,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:44:10,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:44:10,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:10,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:10,591 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:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:10,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483848372] [2025-04-30 10:44:10,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483848372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:10,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074371417] [2025-04-30 10:44:10,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:10,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:10,594 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:10,595 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:10,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:44:10,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:44:10,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:10,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:10,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:44:10,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:10,750 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:10,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:10,815 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:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074371417] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:10,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-04-30 10:44:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038901048] [2025-04-30 10:44:10,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:10,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:10,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:10,816 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:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:11,244 INFO L93 Difference]: Finished difference Result 7698 states and 10403 transitions. [2025-04-30 10:44:11,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-30 10:44:11,245 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:11,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:11,270 INFO L225 Difference]: With dead ends: 7698 [2025-04-30 10:44:11,270 INFO L226 Difference]: Without dead ends: 7698 [2025-04-30 10:44:11,271 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:11,271 INFO L437 NwaCegarLoop]: 127 mSDtfsCounter, 350 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:11,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 943 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7698 states. [2025-04-30 10:44:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7698 to 4676. [2025-04-30 10:44:11,343 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:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 6408 transitions. [2025-04-30 10:44:11,358 INFO L79 Accepts]: Start accepts. Automaton has 4676 states and 6408 transitions. Word has length 68 [2025-04-30 10:44:11,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:11,358 INFO L485 AbstractCegarLoop]: Abstraction has 4676 states and 6408 transitions. [2025-04-30 10:44:11,358 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:11,358 INFO L278 IsEmpty]: Start isEmpty. Operand 4676 states and 6408 transitions. [2025-04-30 10:44:11,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-30 10:44:11,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:11,359 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:11,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:44:11,560 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:11,560 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:11,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1825876446, now seen corresponding path program 1 times [2025-04-30 10:44:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:11,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351196211] [2025-04-30 10:44:11,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:11,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:11,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:44:11,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:44:11,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:11,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:11,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:44:11,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:44:11,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:44:11,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:11,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:11,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:44:11,623 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:44:11,624 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-04-30 10:44:11,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-04-30 10:44:11,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-04-30 10:44:11,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-04-30 10:44:11,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-04-30 10:44:11,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-04-30 10:44:11,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-04-30 10:44:11,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:44:11,628 INFO L422 BasicCegarLoop]: Path program histogram: [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:11,697 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:44:11,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:44:11 BoogieIcfgContainer [2025-04-30 10:44:11,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:44:11,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:44:11,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:44:11,700 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:44:11,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:03" (3/4) ... [2025-04-30 10:44:11,702 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:44:11,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:44:11,703 INFO L158 Benchmark]: Toolchain (without parser) took 9157.94ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.0MB in the beginning and 317.4MB in the end (delta: -205.4MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2025-04-30 10:44:11,704 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:11,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.73ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 91.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:11,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.74ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:44:11,704 INFO L158 Benchmark]: Boogie Preprocessor took 50.50ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:11,705 INFO L158 Benchmark]: RCFGBuilder took 336.18ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 67.9MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:11,705 INFO L158 Benchmark]: TraceAbstraction took 8363.22ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 67.4MB in the beginning and 317.5MB in the end (delta: -250.1MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:11,705 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 427.8MB. Free memory was 317.5MB in the beginning and 317.4MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:11,708 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.73ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 91.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.74ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.50ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 336.18ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 67.9MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8363.22ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 67.4MB in the beginning and 317.5MB in the end (delta: -250.1MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 427.8MB. Free memory was 317.5MB in the beginning and 317.4MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L545] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L552] S = x1 VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 82 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2769 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2769 mSDsluCounter, 6618 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4858 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1729 IncrementalHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 1760 mSDtfsCounter, 1729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1000 GetRequests, 783 SyntacticMatches, 14 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4878occurred in iteration=19, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 6559 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 960 NumberOfCodeBlocks, 960 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1248 ConstructedInterpolants, 0 QuantifiedInterpolants, 2892 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1786 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 40 InterpolantComputations, 11 PerfectInterpolantSequences, 1436/1759 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:44:11,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:13,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:13,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-30 10:44:13,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:13,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:13,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:13,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:13,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:13,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:13,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:13,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:13,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:13,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:13,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:13,717 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:13,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:13,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:13,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:13,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:13,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:13,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:13,720 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:44:13,720 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:44:13,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:13,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:13,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:13,720 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2025-04-30 10:44:13,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:13,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:13,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:13,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:13,980 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:13,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1.i [2025-04-30 10:44:15,255 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b259a7b54/64858f5aa18344e699db480f77bbd520/FLAG0bd9324ea [2025-04-30 10:44:15,435 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:15,435 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.1.i [2025-04-30 10:44:15,443 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b259a7b54/64858f5aa18344e699db480f77bbd520/FLAG0bd9324ea [2025-04-30 10:44:16,256 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b259a7b54/64858f5aa18344e699db480f77bbd520 [2025-04-30 10:44:16,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:16,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:16,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:16,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:16,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:16,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bbecf16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16, skipping insertion in model container [2025-04-30 10:44:16,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:16,533 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:16,543 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:16,598 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:16,626 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:16,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16 WrapperNode [2025-04-30 10:44:16,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:16,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:16,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:16,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:16,632 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:44:16" (1/1) ... [2025-04-30 10:44:16,645 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:44:16" (1/1) ... [2025-04-30 10:44:16,666 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 129 [2025-04-30 10:44:16,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:16,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:16,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:16,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:16,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,697 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:44:16,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:16,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:16,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:16,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:16,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (1/1) ... [2025-04-30 10:44:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:16,759 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:44:16,764 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:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-04-30 10:44:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:16,880 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:16,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:17,183 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:17,183 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:17,191 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:17,191 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:44:17,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:17 BoogieIcfgContainer [2025-04-30 10:44:17,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:17,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:17,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:17,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:17,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:16" (1/3) ... [2025-04-30 10:44:17,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e75260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:17, skipping insertion in model container [2025-04-30 10:44:17,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:16" (2/3) ... [2025-04-30 10:44:17,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e75260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:17, skipping insertion in model container [2025-04-30 10:44:17,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:17" (3/3) ... [2025-04-30 10:44:17,201 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2025-04-30 10:44:17,211 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:17,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.1.i that has 1 procedures, 64 locations, 82 edges, 1 initial locations, 2 loop locations, and 20 error locations. [2025-04-30 10:44:17,240 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:17,247 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;@168d6b38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:17,248 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-30 10:44:17,250 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:44:17,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:44:17,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:17,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:44:17,257 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:44:17,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 28820323, now seen corresponding path program 1 times [2025-04-30 10:44:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:17,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90148130] [2025-04-30 10:44:17,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:17,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:17,272 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:17,273 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:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:44:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:44:17,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:17,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:17,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-30 10:44:17,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:17,382 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:17,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:17,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:17,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90148130] [2025-04-30 10:44:17,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90148130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:17,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:17,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906085663] [2025-04-30 10:44:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:17,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:44:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:17,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:44:17,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:17,403 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:44:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:17,415 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-04-30 10:44:17,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:44:17,417 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:44:17,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:17,421 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:44:17,421 INFO L226 Difference]: Without dead ends: 62 [2025-04-30 10:44:17,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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:44:17,424 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:44:17,425 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:44:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-30 10:44:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-30 10:44:17,445 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:44:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-04-30 10:44:17,451 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2025-04-30 10:44:17,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:17,451 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-30 10:44:17,451 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:44:17,451 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-04-30 10:44:17,451 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:17,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:17,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:17,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:44:17,652 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 [2025-04-30 10:44:17,652 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:44:17,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1805898957, now seen corresponding path program 1 times [2025-04-30 10:44:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:17,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507872828] [2025-04-30 10:44:17,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:17,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:17,656 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:17,657 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:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:17,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:17,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:17,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:17,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:44:17,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:17,718 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:17,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:17,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:17,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507872828] [2025-04-30 10:44:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507872828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:17,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:17,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992373561] [2025-04-30 10:44:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:17,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:17,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:17,721 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:44:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:17,737 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-04-30 10:44:17,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:17,737 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:44:17,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:17,738 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:44:17,738 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:44:17,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:17,740 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:44:17,740 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:44:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:44:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-30 10:44:17,743 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:44:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-04-30 10:44:17,747 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2025-04-30 10:44:17,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:17,747 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-04-30 10:44:17,748 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:44:17,749 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-04-30 10:44:17,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:17,749 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:17,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:17,755 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:17,949 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 [2025-04-30 10:44:17,950 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:44:17,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958539, now seen corresponding path program 1 times [2025-04-30 10:44:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:17,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620691807] [2025-04-30 10:44:17,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:17,952 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:17,953 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:17,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:17,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:44:17,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:18,011 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:18,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:18,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:18,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620691807] [2025-04-30 10:44:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620691807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:18,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:18,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023744837] [2025-04-30 10:44:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:18,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:18,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:18,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:18,012 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:44:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:18,111 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2025-04-30 10:44:18,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:18,111 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:44:18,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:18,112 INFO L225 Difference]: With dead ends: 117 [2025-04-30 10:44:18,112 INFO L226 Difference]: Without dead ends: 116 [2025-04-30 10:44:18,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:18,112 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:18,113 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.1s Time] [2025-04-30 10:44:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-30 10:44:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2025-04-30 10:44:18,121 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:44:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-04-30 10:44:18,121 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 7 [2025-04-30 10:44:18,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:18,121 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-04-30 10:44:18,122 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:44:18,122 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-04-30 10:44:18,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:18,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:18,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:18,129 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:18,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:18,322 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:44:18,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958155, now seen corresponding path program 1 times [2025-04-30 10:44:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:18,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027529286] [2025-04-30 10:44:18,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:18,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:18,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:18,328 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:18,329 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:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:18,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:18,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:18,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:18,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:44:18,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:18,427 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:18,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:18,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:18,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027529286] [2025-04-30 10:44:18,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027529286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:18,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:18,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750959017] [2025-04-30 10:44:18,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:18,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:18,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:18,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:18,429 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:44:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:18,475 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2025-04-30 10:44:18,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:18,476 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:44:18,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:18,477 INFO L225 Difference]: With dead ends: 178 [2025-04-30 10:44:18,477 INFO L226 Difference]: Without dead ends: 177 [2025-04-30 10:44:18,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:18,478 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:44:18,478 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:44:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-30 10:44:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2025-04-30 10:44:18,488 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:44:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 247 transitions. [2025-04-30 10:44:18,490 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 247 transitions. Word has length 7 [2025-04-30 10:44:18,490 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:18,491 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 247 transitions. [2025-04-30 10:44:18,491 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:44:18,491 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 247 transitions. [2025-04-30 10:44:18,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:18,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:18,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:18,497 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:18,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:18,692 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:44:18,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash 296297806, now seen corresponding path program 1 times [2025-04-30 10:44:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:18,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209264788] [2025-04-30 10:44:18,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:18,695 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:18,697 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:18,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:18,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:18,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:18,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:18,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:44:18,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:18,786 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:18,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:18,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:18,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209264788] [2025-04-30 10:44:18,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209264788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:18,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:18,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478966696] [2025-04-30 10:44:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:18,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:18,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:18,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:18,789 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:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:18,830 INFO L93 Difference]: Finished difference Result 159 states and 253 transitions. [2025-04-30 10:44:18,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:18,832 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:18,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:18,833 INFO L225 Difference]: With dead ends: 159 [2025-04-30 10:44:18,833 INFO L226 Difference]: Without dead ends: 159 [2025-04-30 10:44:18,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:18,833 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:18,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-30 10:44:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-04-30 10:44:18,840 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:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 249 transitions. [2025-04-30 10:44:18,841 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 249 transitions. Word has length 9 [2025-04-30 10:44:18,844 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:18,844 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 249 transitions. [2025-04-30 10:44:18,845 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:18,845 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 249 transitions. [2025-04-30 10:44:18,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:18,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:18,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:18,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:44:19,045 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 [2025-04-30 10:44:19,046 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:19,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash 353556108, now seen corresponding path program 1 times [2025-04-30 10:44:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:19,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512694838] [2025-04-30 10:44:19,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:19,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:19,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:19,049 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:19,049 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:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:19,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:19,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:19,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:19,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:44:19,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:19,118 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 6 treesize of output 7 [2025-04-30 10:44:19,123 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:19,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:19,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:19,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512694838] [2025-04-30 10:44:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512694838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:19,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:19,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17975769] [2025-04-30 10:44:19,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:19,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:19,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:19,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:19,124 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:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:19,202 INFO L93 Difference]: Finished difference Result 233 states and 358 transitions. [2025-04-30 10:44:19,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:19,202 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:19,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:19,203 INFO L225 Difference]: With dead ends: 233 [2025-04-30 10:44:19,203 INFO L226 Difference]: Without dead ends: 233 [2025-04-30 10:44:19,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:19,204 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 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.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:19,204 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-30 10:44:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 213. [2025-04-30 10:44:19,213 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:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 345 transitions. [2025-04-30 10:44:19,214 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 345 transitions. Word has length 9 [2025-04-30 10:44:19,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:19,214 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 345 transitions. [2025-04-30 10:44:19,214 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:19,214 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 345 transitions. [2025-04-30 10:44:19,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:44:19,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:19,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:19,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:44:19,415 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 [2025-04-30 10:44:19,415 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:19,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 353556109, now seen corresponding path program 1 times [2025-04-30 10:44:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:19,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300118433] [2025-04-30 10:44:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:19,418 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:19,419 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:19,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:44:19,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:44:19,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:19,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:19,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:44:19,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:19,477 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 6 treesize of output 5 [2025-04-30 10:44:19,487 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:19,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:19,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:19,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300118433] [2025-04-30 10:44:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300118433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:19,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:19,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916433902] [2025-04-30 10:44:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:19,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:19,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:19,488 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:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:19,573 INFO L93 Difference]: Finished difference Result 228 states and 349 transitions. [2025-04-30 10:44:19,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:19,575 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:19,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:19,576 INFO L225 Difference]: With dead ends: 228 [2025-04-30 10:44:19,576 INFO L226 Difference]: Without dead ends: 228 [2025-04-30 10:44:19,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:19,577 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:19,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-30 10:44:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2025-04-30 10:44:19,585 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:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 337 transitions. [2025-04-30 10:44:19,586 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 337 transitions. Word has length 9 [2025-04-30 10:44:19,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:19,586 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 337 transitions. [2025-04-30 10:44:19,586 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:19,586 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 337 transitions. [2025-04-30 10:44:19,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:19,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:19,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:19,595 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:19,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:19,787 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:19,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:19,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1924654535, now seen corresponding path program 1 times [2025-04-30 10:44:19,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:19,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503717454] [2025-04-30 10:44:19,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:19,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:19,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:19,789 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:19,791 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:19,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:19,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:19,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:19,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:19,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:44:19,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:19,860 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:19,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:19,860 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:19,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503717454] [2025-04-30 10:44:19,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503717454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:19,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:19,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691939378] [2025-04-30 10:44:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:19,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:19,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:19,861 INFO L87 Difference]: Start difference. First operand 211 states and 337 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:19,886 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-04-30 10:44:19,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:19,886 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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:19,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:19,887 INFO L225 Difference]: With dead ends: 190 [2025-04-30 10:44:19,887 INFO L226 Difference]: Without dead ends: 190 [2025-04-30 10:44:19,887 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:19,888 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 45 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 194 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:19,888 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 194 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:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-30 10:44:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 168. [2025-04-30 10:44:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 156 states have (on average 1.6602564102564104) internal successors, (259), 167 states have internal predecessors, (259), 0 states have call successors, (0), 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:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 259 transitions. [2025-04-30 10:44:19,894 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 259 transitions. Word has length 10 [2025-04-30 10:44:19,894 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:19,894 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 259 transitions. [2025-04-30 10:44:19,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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:19,894 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 259 transitions. [2025-04-30 10:44:19,896 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:44:19,896 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:19,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:19,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:44:20,096 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 [2025-04-30 10:44:20,097 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:20,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash 516607341, now seen corresponding path program 1 times [2025-04-30 10:44:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:20,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925224107] [2025-04-30 10:44:20,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:20,099 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:20,100 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:20,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:44:20,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:44:20,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:44:20,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:20,161 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:20,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:20,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:20,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925224107] [2025-04-30 10:44:20,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925224107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:20,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196460574] [2025-04-30 10:44:20,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:20,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:20,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:20,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:20,162 INFO L87 Difference]: Start difference. First operand 168 states and 259 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:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:20,185 INFO L93 Difference]: Finished difference Result 260 states and 382 transitions. [2025-04-30 10:44:20,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:20,185 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:20,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:20,186 INFO L225 Difference]: With dead ends: 260 [2025-04-30 10:44:20,186 INFO L226 Difference]: Without dead ends: 260 [2025-04-30 10:44:20,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:20,187 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 191 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:20,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 191 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:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-30 10:44:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 245. [2025-04-30 10:44:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 244 states have internal predecessors, (367), 0 states have call successors, (0), 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,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 367 transitions. [2025-04-30 10:44:20,192 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 367 transitions. Word has length 11 [2025-04-30 10:44:20,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:20,192 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 367 transitions. [2025-04-30 10:44:20,192 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:20,193 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 367 transitions. [2025-04-30 10:44:20,193 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:44:20,193 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:20,193 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:20,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:44:20,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:20,394 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:20,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1842808106, now seen corresponding path program 1 times [2025-04-30 10:44:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:20,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310901426] [2025-04-30 10:44:20,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:20,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:20,396 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:20,397 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:20,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:20,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:20,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:44:20,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:20,499 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:20,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:20,539 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:20,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:20,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310901426] [2025-04-30 10:44:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310901426] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:20,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-04-30 10:44:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784400813] [2025-04-30 10:44:20,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:20,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:20,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:20,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:20,541 INFO L87 Difference]: Start difference. First operand 245 states and 367 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:20,622 INFO L93 Difference]: Finished difference Result 551 states and 783 transitions. [2025-04-30 10:44:20,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:20,623 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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 16 [2025-04-30 10:44:20,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:20,625 INFO L225 Difference]: With dead ends: 551 [2025-04-30 10:44:20,625 INFO L226 Difference]: Without dead ends: 551 [2025-04-30 10:44:20,625 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:20,626 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 256 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:20,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 435 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-04-30 10:44:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 511. [2025-04-30 10:44:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 499 states have (on average 1.5370741482965933) internal successors, (767), 510 states have internal predecessors, (767), 0 states have call successors, (0), 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,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 767 transitions. [2025-04-30 10:44:20,634 INFO L79 Accepts]: Start accepts. Automaton has 511 states and 767 transitions. Word has length 16 [2025-04-30 10:44:20,634 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:20,634 INFO L485 AbstractCegarLoop]: Abstraction has 511 states and 767 transitions. [2025-04-30 10:44:20,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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:20,635 INFO L278 IsEmpty]: Start isEmpty. Operand 511 states and 767 transitions. [2025-04-30 10:44:20,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:44:20,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:20,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:20,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:44:20,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:20,836 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:20,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 933583904, now seen corresponding path program 1 times [2025-04-30 10:44:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:20,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528114621] [2025-04-30 10:44:20,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:20,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:20,838 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:20,839 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:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:44:20,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:44:20,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:44:20,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:20,913 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:20,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:20,953 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:20,954 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:20,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528114621] [2025-04-30 10:44:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528114621] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:20,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:20,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-30 10:44:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670999959] [2025-04-30 10:44:20,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:20,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:20,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:20,954 INFO L87 Difference]: Start difference. First operand 511 states and 767 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:21,079 INFO L93 Difference]: Finished difference Result 1420 states and 2081 transitions. [2025-04-30 10:44:21,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:21,080 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:21,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:21,085 INFO L225 Difference]: With dead ends: 1420 [2025-04-30 10:44:21,085 INFO L226 Difference]: Without dead ends: 1420 [2025-04-30 10:44:21,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:44:21,086 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 271 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:21,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 523 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-04-30 10:44:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1246. [2025-04-30 10:44:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1234 states have (on average 1.5016207455429498) internal successors, (1853), 1245 states have internal predecessors, (1853), 0 states have call successors, (0), 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:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1853 transitions. [2025-04-30 10:44:21,110 INFO L79 Accepts]: Start accepts. Automaton has 1246 states and 1853 transitions. Word has length 18 [2025-04-30 10:44:21,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:21,111 INFO L485 AbstractCegarLoop]: Abstraction has 1246 states and 1853 transitions. [2025-04-30 10:44:21,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:21,111 INFO L278 IsEmpty]: Start isEmpty. Operand 1246 states and 1853 transitions. [2025-04-30 10:44:21,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:21,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:21,111 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:21,117 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:21,312 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 [2025-04-30 10:44:21,312 INFO L403 AbstractCegarLoop]: === Iteration 12 === 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:21,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1395065772, now seen corresponding path program 1 times [2025-04-30 10:44:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:21,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241136577] [2025-04-30 10:44:21,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:21,314 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:21,319 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:21,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:21,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:21,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:44:21,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:21,440 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:21,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:21,497 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:21,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:21,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241136577] [2025-04-30 10:44:21,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241136577] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:21,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:21,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2025-04-30 10:44:21,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320213069] [2025-04-30 10:44:21,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:21,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:21,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:21,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:21,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:21,498 INFO L87 Difference]: Start difference. First operand 1246 states and 1853 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:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:21,604 INFO L93 Difference]: Finished difference Result 3656 states and 5355 transitions. [2025-04-30 10:44:21,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:21,604 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:21,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:21,615 INFO L225 Difference]: With dead ends: 3656 [2025-04-30 10:44:21,615 INFO L226 Difference]: Without dead ends: 3656 [2025-04-30 10:44:21,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:21,616 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 173 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:21,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 170 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2025-04-30 10:44:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3373. [2025-04-30 10:44:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3373 states, 3361 states have (on average 1.4855697709015174) internal successors, (4993), 3372 states have internal predecessors, (4993), 0 states have call successors, (0), 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:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 4993 transitions. [2025-04-30 10:44:21,688 INFO L79 Accepts]: Start accepts. Automaton has 3373 states and 4993 transitions. Word has length 27 [2025-04-30 10:44:21,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:21,688 INFO L485 AbstractCegarLoop]: Abstraction has 3373 states and 4993 transitions. [2025-04-30 10:44:21,688 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:21,688 INFO L278 IsEmpty]: Start isEmpty. Operand 3373 states and 4993 transitions. [2025-04-30 10:44:21,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:44:21,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:21,688 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:21,694 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:21,893 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 [2025-04-30 10:44:21,893 INFO L403 AbstractCegarLoop]: === Iteration 13 === 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:21,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1359367982, now seen corresponding path program 1 times [2025-04-30 10:44:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:21,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879351446] [2025-04-30 10:44:21,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:21,895 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:21,896 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:21,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:21,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:21,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:44:21,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:21,981 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:21,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:22,028 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:22,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:22,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879351446] [2025-04-30 10:44:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879351446] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:22,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:22,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-30 10:44:22,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116984025] [2025-04-30 10:44:22,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:22,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:22,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:22,030 INFO L87 Difference]: Start difference. First operand 3373 states and 4993 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,182 INFO L93 Difference]: Finished difference Result 3719 states and 5287 transitions. [2025-04-30 10:44:22,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:44:22,182 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:44:22,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,195 INFO L225 Difference]: With dead ends: 3719 [2025-04-30 10:44:22,205 INFO L226 Difference]: Without dead ends: 3719 [2025-04-30 10:44:22,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:44:22,206 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 293 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 523 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-04-30 10:44:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3429. [2025-04-30 10:44:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3417 states have (on average 1.4612232952882647) internal successors, (4993), 3428 states have internal predecessors, (4993), 0 states have call successors, (0), 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:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4993 transitions. [2025-04-30 10:44:22,259 INFO L79 Accepts]: Start accepts. Automaton has 3429 states and 4993 transitions. Word has length 28 [2025-04-30 10:44:22,259 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,259 INFO L485 AbstractCegarLoop]: Abstraction has 3429 states and 4993 transitions. [2025-04-30 10:44:22,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:22,259 INFO L278 IsEmpty]: Start isEmpty. Operand 3429 states and 4993 transitions. [2025-04-30 10:44:22,260 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:44:22,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,261 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:22,269 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:22,461 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 [2025-04-30 10:44:22,461 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:22,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,462 INFO L85 PathProgramCache]: Analyzing trace with hash 716480828, now seen corresponding path program 1 times [2025-04-30 10:44:22,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:22,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600382278] [2025-04-30 10:44:22,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:22,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:22,464 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:22,464 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:22,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:44:22,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:44:22,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:44:22,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:22,549 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:22,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:22,572 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:22,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:22,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600382278] [2025-04-30 10:44:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600382278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:22,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-04-30 10:44:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830999211] [2025-04-30 10:44:22,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:22,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:22,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:22,574 INFO L87 Difference]: Start difference. First operand 3429 states and 4993 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:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,626 INFO L93 Difference]: Finished difference Result 1412 states and 2004 transitions. [2025-04-30 10:44:22,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:22,626 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:22,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,638 INFO L225 Difference]: With dead ends: 1412 [2025-04-30 10:44:22,638 INFO L226 Difference]: Without dead ends: 1412 [2025-04-30 10:44:22,639 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 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:22,639 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 428 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:22,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 428 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:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-04-30 10:44:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1374. [2025-04-30 10:44:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1362 states have (on average 1.4434654919236416) internal successors, (1966), 1373 states have internal predecessors, (1966), 0 states have call successors, (0), 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:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1966 transitions. [2025-04-30 10:44:22,658 INFO L79 Accepts]: Start accepts. Automaton has 1374 states and 1966 transitions. Word has length 30 [2025-04-30 10:44:22,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,658 INFO L485 AbstractCegarLoop]: Abstraction has 1374 states and 1966 transitions. [2025-04-30 10:44:22,658 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:22,658 INFO L278 IsEmpty]: Start isEmpty. Operand 1374 states and 1966 transitions. [2025-04-30 10:44:22,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:44:22,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,660 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:44:22,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:22,869 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:22,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1457047439, now seen corresponding path program 1 times [2025-04-30 10:44:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:22,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489309485] [2025-04-30 10:44:22,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:22,874 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:22,875 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:22,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:44:22,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:44:22,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:44:22,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:44:23,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:44:23,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:23,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489309485] [2025-04-30 10:44:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489309485] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:23,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-30 10:44:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310229690] [2025-04-30 10:44:23,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:23,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:23,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:23,056 INFO L87 Difference]: Start difference. First operand 1374 states and 1966 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,150 INFO L93 Difference]: Finished difference Result 2236 states and 3207 transitions. [2025-04-30 10:44:23,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:23,150 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-30 10:44:23,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,156 INFO L225 Difference]: With dead ends: 2236 [2025-04-30 10:44:23,156 INFO L226 Difference]: Without dead ends: 2236 [2025-04-30 10:44:23,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:23,156 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 78 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 367 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2025-04-30 10:44:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1930. [2025-04-30 10:44:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1918 states have (on average 1.4410844629822732) internal successors, (2764), 1929 states have internal predecessors, (2764), 0 states have call successors, (0), 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:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2764 transitions. [2025-04-30 10:44:23,194 INFO L79 Accepts]: Start accepts. Automaton has 1930 states and 2764 transitions. Word has length 43 [2025-04-30 10:44:23,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,194 INFO L485 AbstractCegarLoop]: Abstraction has 1930 states and 2764 transitions. [2025-04-30 10:44:23,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:23,194 INFO L278 IsEmpty]: Start isEmpty. Operand 1930 states and 2764 transitions. [2025-04-30 10:44:23,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:44:23,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,195 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:23,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:44:23,395 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 [2025-04-30 10:44:23,396 INFO L403 AbstractCegarLoop]: === Iteration 16 === 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:23,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 354889389, now seen corresponding path program 1 times [2025-04-30 10:44:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:23,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143047584] [2025-04-30 10:44:23,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:23,399 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:23,401 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:23,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:44:23,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:44:23,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:44:23,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:23,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-30 10:44:23,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:23,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143047584] [2025-04-30 10:44:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143047584] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:23,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-04-30 10:44:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083744048] [2025-04-30 10:44:23,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:23,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:23,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:23,645 INFO L87 Difference]: Start difference. First operand 1930 states and 2764 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,908 INFO L93 Difference]: Finished difference Result 2066 states and 2805 transitions. [2025-04-30 10:44:23,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:44:23,908 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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 43 [2025-04-30 10:44:23,909 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,914 INFO L225 Difference]: With dead ends: 2066 [2025-04-30 10:44:23,914 INFO L226 Difference]: Without dead ends: 2066 [2025-04-30 10:44:23,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:44:23,915 INFO L437 NwaCegarLoop]: 239 mSDtfsCounter, 315 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1722 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2025-04-30 10:44:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1477. [2025-04-30 10:44:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1465 states have (on average 1.3904436860068259) internal successors, (2037), 1476 states have internal predecessors, (2037), 0 states have call successors, (0), 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:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2037 transitions. [2025-04-30 10:44:23,938 INFO L79 Accepts]: Start accepts. Automaton has 1477 states and 2037 transitions. Word has length 43 [2025-04-30 10:44:23,938 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,938 INFO L485 AbstractCegarLoop]: Abstraction has 1477 states and 2037 transitions. [2025-04-30 10:44:23,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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:23,938 INFO L278 IsEmpty]: Start isEmpty. Operand 1477 states and 2037 transitions. [2025-04-30 10:44:23,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:44:23,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,939 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:23,945 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:24,142 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 [2025-04-30 10:44:24,143 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:24,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1054325134, now seen corresponding path program 1 times [2025-04-30 10:44:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:24,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9286208] [2025-04-30 10:44:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:24,146 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:24,148 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:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:44:24,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:44:24,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:44:24,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:24,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-04-30 10:44:24,394 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:24,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9286208] [2025-04-30 10:44:24,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9286208] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:24,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:24,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-04-30 10:44:24,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501386522] [2025-04-30 10:44:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:24,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:24,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:24,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:24,395 INFO L87 Difference]: Start difference. First operand 1477 states and 2037 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) 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:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,472 INFO L93 Difference]: Finished difference Result 1987 states and 2718 transitions. [2025-04-30 10:44:24,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:24,473 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) 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 45 [2025-04-30 10:44:24,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,478 INFO L225 Difference]: With dead ends: 1987 [2025-04-30 10:44:24,478 INFO L226 Difference]: Without dead ends: 1987 [2025-04-30 10:44:24,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:44:24,479 INFO L437 NwaCegarLoop]: 94 mSDtfsCounter, 42 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 337 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-04-30 10:44:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1787. [2025-04-30 10:44:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1775 states have (on average 1.388732394366197) internal successors, (2465), 1786 states have internal predecessors, (2465), 0 states have call successors, (0), 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,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2465 transitions. [2025-04-30 10:44:24,507 INFO L79 Accepts]: Start accepts. Automaton has 1787 states and 2465 transitions. Word has length 45 [2025-04-30 10:44:24,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,507 INFO L485 AbstractCegarLoop]: Abstraction has 1787 states and 2465 transitions. [2025-04-30 10:44:24,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) 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:24,507 INFO L278 IsEmpty]: Start isEmpty. Operand 1787 states and 2465 transitions. [2025-04-30 10:44:24,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:44:24,508 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,508 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,515 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:24,712 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 [2025-04-30 10:44:24,712 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:24,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash -65085218, now seen corresponding path program 1 times [2025-04-30 10:44:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:24,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270690012] [2025-04-30 10:44:24,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:24,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:24,715 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:24,716 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:24,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:44:24,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:44:24,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:44:24,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:24,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-30 10:44:24,973 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:24,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270690012] [2025-04-30 10:44:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270690012] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:24,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-04-30 10:44:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437466752] [2025-04-30 10:44:24,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:24,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:24,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:24,975 INFO L87 Difference]: Start difference. First operand 1787 states and 2465 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,255 INFO L93 Difference]: Finished difference Result 3594 states and 4963 transitions. [2025-04-30 10:44:25,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:44:25,256 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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 47 [2025-04-30 10:44:25,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,265 INFO L225 Difference]: With dead ends: 3594 [2025-04-30 10:44:25,265 INFO L226 Difference]: Without dead ends: 3594 [2025-04-30 10:44:25,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:44:25,266 INFO L437 NwaCegarLoop]: 222 mSDtfsCounter, 622 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,266 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1678 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-04-30 10:44:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 2680. [2025-04-30 10:44:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2668 states have (on average 1.4250374812593702) internal successors, (3802), 2679 states have internal predecessors, (3802), 0 states have call successors, (0), 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,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3802 transitions. [2025-04-30 10:44:25,309 INFO L79 Accepts]: Start accepts. Automaton has 2680 states and 3802 transitions. Word has length 47 [2025-04-30 10:44:25,309 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,309 INFO L485 AbstractCegarLoop]: Abstraction has 2680 states and 3802 transitions. [2025-04-30 10:44:25,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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,310 INFO L278 IsEmpty]: Start isEmpty. Operand 2680 states and 3802 transitions. [2025-04-30 10:44:25,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:44:25,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,310 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:25,511 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 [2025-04-30 10:44:25,511 INFO L403 AbstractCegarLoop]: === Iteration 19 === 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:25,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1270542134, now seen corresponding path program 1 times [2025-04-30 10:44:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:25,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183722534] [2025-04-30 10:44:25,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:25,513 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:25,515 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:25,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:44:25,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:44:25,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:44:25,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:25,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:25,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:25,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183722534] [2025-04-30 10:44:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183722534] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:25,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-04-30 10:44:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578483518] [2025-04-30 10:44:25,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:44:25,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:25,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:44:25,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:44:25,800 INFO L87 Difference]: Start difference. First operand 2680 states and 3802 transitions. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,225 INFO L93 Difference]: Finished difference Result 8571 states and 12168 transitions. [2025-04-30 10:44:26,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-30 10:44:26,225 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-04-30 10:44:26,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,253 INFO L225 Difference]: With dead ends: 8571 [2025-04-30 10:44:26,253 INFO L226 Difference]: Without dead ends: 8571 [2025-04-30 10:44:26,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2025-04-30 10:44:26,254 INFO L437 NwaCegarLoop]: 266 mSDtfsCounter, 1015 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 2085 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2025-04-30 10:44:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 8153. [2025-04-30 10:44:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8153 states, 8141 states have (on average 1.4474880235843262) internal successors, (11784), 8152 states have internal predecessors, (11784), 0 states have call successors, (0), 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,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8153 states to 8153 states and 11784 transitions. [2025-04-30 10:44:26,389 INFO L79 Accepts]: Start accepts. Automaton has 8153 states and 11784 transitions. Word has length 57 [2025-04-30 10:44:26,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,390 INFO L485 AbstractCegarLoop]: Abstraction has 8153 states and 11784 transitions. [2025-04-30 10:44:26,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:26,394 INFO L278 IsEmpty]: Start isEmpty. Operand 8153 states and 11784 transitions. [2025-04-30 10:44:26,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-30 10:44:26,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,395 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:26,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:26,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:26,596 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:26,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1825876446, now seen corresponding path program 1 times [2025-04-30 10:44:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:26,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764595249] [2025-04-30 10:44:26,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:26,599 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:26,600 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:26,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:44:26,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:44:26,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:26,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:44:26,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:44:26,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:44:26,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:26,829 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-30 10:44:26,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:44:26,830 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-04-30 10:44:26,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-04-30 10:44:26,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-04-30 10:44:26,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-04-30 10:44:26,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-04-30 10:44:26,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-04-30 10:44:26,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-04-30 10:44:26,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-04-30 10:44:26,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-30 10:44:27,032 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 [2025-04-30 10:44:27,035 INFO L422 BasicCegarLoop]: Path program histogram: [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:27,100 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:44:27,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:44:27 BoogieIcfgContainer [2025-04-30 10:44:27,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:44:27,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:44:27,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:44:27,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:44:27,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:17" (3/4) ... [2025-04-30 10:44:27,106 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:44:27,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:44:27,107 INFO L158 Benchmark]: Toolchain (without parser) took 10848.16ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 90.6MB in the beginning and 56.6MB in the end (delta: 34.0MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2025-04-30 10:44:27,107 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:27,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.31ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 68.9MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:27,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.37ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:27,108 INFO L158 Benchmark]: Boogie Preprocessor took 58.93ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:27,108 INFO L158 Benchmark]: RCFGBuilder took 465.49ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 43.1MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:44:27,109 INFO L158 Benchmark]: TraceAbstraction took 9910.52ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 42.5MB in the beginning and 57.9MB in the end (delta: -15.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2025-04-30 10:44:27,109 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 56.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:44:27,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.31ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 68.9MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.37ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.93ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 465.49ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 43.1MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9910.52ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 42.5MB in the beginning and 57.9MB in the end (delta: -15.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 56.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L542] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L545] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L548] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L552] S = x1 VAL [S={3:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={3:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={3:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={3:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={3:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [S={3:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={3:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={3:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 82 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3488 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3488 mSDsluCounter, 9714 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7554 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1317 IncrementalHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 2160 mSDtfsCounter, 1317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8153occurred in iteration=19, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 3372 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2062 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 420/784 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:44:27,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample