./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-properties/list_search-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:11:54,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:11:54,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:11:54,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:11:54,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:11:54,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:11:54,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:11:54,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:11:54,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:11:54,394 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:11:54,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:11:54,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:11:54,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:11:54,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:11:54,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:11:54,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:11:54,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:11:54,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:11:54,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:11:54,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:11:54,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:11:54,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:11:54,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:11:54,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:11:54,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:11:54,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:11:54,398 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 ! call(reach_error())) ) 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2025-04-30 10:11:54,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:11:54,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:11:54,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:11:54,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:11:54,633 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:11:54,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-1.i [2025-04-30 10:11:55,925 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85597925/ea19bbdac0bc4b26b352e7f18eeaf8b0/FLAGcf7209251 [2025-04-30 10:11:56,166 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:11:56,168 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i [2025-04-30 10:11:56,180 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85597925/ea19bbdac0bc4b26b352e7f18eeaf8b0/FLAGcf7209251 [2025-04-30 10:11:56,975 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85597925/ea19bbdac0bc4b26b352e7f18eeaf8b0 [2025-04-30 10:11:56,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:11:56,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:11:56,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:11:56,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:11:56,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:11:56,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:11:56" (1/1) ... [2025-04-30 10:11:56,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123b325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:56, skipping insertion in model container [2025-04-30 10:11:56,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:11:56" (1/1) ... [2025-04-30 10:11:57,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:11:57,136 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i[813,826] [2025-04-30 10:11:57,221 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:11:57,227 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:11:57,247 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i[813,826] [2025-04-30 10:11:57,283 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:11:57,307 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:11:57,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57 WrapperNode [2025-04-30 10:11:57,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:11:57,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:11:57,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:11:57,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:11:57,313 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:11:57" (1/1) ... [2025-04-30 10:11:57,322 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:11:57" (1/1) ... [2025-04-30 10:11:57,337 INFO L138 Inliner]: procedures = 125, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-04-30 10:11:57,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:11:57,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:11:57,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:11:57,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:11:57,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,363 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 4 writes are split as follows [0, 4]. [2025-04-30 10:11:57,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:11:57,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:11:57,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:11:57,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:11:57,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (1/1) ... [2025-04-30 10:11:57,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:11:57,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:11:57,407 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:11:57,422 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:11:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:11:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:11:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:11:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2025-04-30 10:11:57,444 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:11:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:11:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:11:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:11:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:11:57,547 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:11:57,549 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:11:57,700 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-04-30 10:11:57,700 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:11:57,709 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:11:57,710 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:11:57,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:11:57 BoogieIcfgContainer [2025-04-30 10:11:57,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:11:57,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:11:57,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:11:57,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:11:57,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:11:56" (1/3) ... [2025-04-30 10:11:57,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54eec8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:11:57, skipping insertion in model container [2025-04-30 10:11:57,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:11:57" (2/3) ... [2025-04-30 10:11:57,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54eec8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:11:57, skipping insertion in model container [2025-04-30 10:11:57,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:11:57" (3/3) ... [2025-04-30 10:11:57,720 INFO L128 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2025-04-30 10:11:57,730 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:11:57,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_search-1.i that has 2 procedures, 29 locations, 41 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-30 10:11:57,772 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:11:57,781 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=LoopHeads, 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;@5bd99fe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:11:57,782 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:11:57,786 INFO L278 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:11:57,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:11:57,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:11:57,792 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:11:57,792 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:11:57,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:11:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 981904323, now seen corresponding path program 1 times [2025-04-30 10:11:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:11:57,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211717699] [2025-04-30 10:11:57,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:11:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:11:57,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:11:57,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:11:57,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:11:57,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:11:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:11:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:11:58,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211717699] [2025-04-30 10:11:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211717699] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:11:58,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044215532] [2025-04-30 10:11:58,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:11:58,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:11:58,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:11:58,248 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:11:58,249 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:11:58,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:11:58,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:11:58,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:11:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:11:58,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-30 10:11:58,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:11:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:11:58,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:11:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044215532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:11:58,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:11:58,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2025-04-30 10:11:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905723219] [2025-04-30 10:11:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:11:58,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:11:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:11:58,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:11:58,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:11:58,440 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:11:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:11:58,452 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-04-30 10:11:58,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:11:58,453 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-04-30 10:11:58,454 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:11:58,458 INFO L225 Difference]: With dead ends: 39 [2025-04-30 10:11:58,458 INFO L226 Difference]: Without dead ends: 24 [2025-04-30 10:11:58,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:11:58,461 INFO L437 NwaCegarLoop]: 35 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, 35 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:11:58,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:11:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-30 10:11:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-30 10:11:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:11:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-04-30 10:11:58,483 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 35 [2025-04-30 10:11:58,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:11:58,484 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-04-30 10:11:58,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:11:58,484 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-04-30 10:11:58,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:11:58,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:11:58,485 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:11:58,491 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:11:58,685 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,SelfDestructingSolverStorable0 [2025-04-30 10:11:58,686 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:11:58,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:11:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2118752644, now seen corresponding path program 1 times [2025-04-30 10:11:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:11:58,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663334903] [2025-04-30 10:11:58,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:11:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:11:58,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:11:58,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:11:58,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:11:58,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:11:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:11:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:11:58,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663334903] [2025-04-30 10:11:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663334903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:11:58,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519208441] [2025-04-30 10:11:58,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:11:58,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:11:58,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:11:58,865 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:11:58,867 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:11:58,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:11:58,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:11:58,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:11:58,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:11:58,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:11:59,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:11:59,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:11:59,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:11:59,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:11:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:11:59,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:11:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519208441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:11:59,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:11:59,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-04-30 10:11:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002082155] [2025-04-30 10:11:59,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:11:59,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:11:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:11:59,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:11:59,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:11:59,219 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:11:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:11:59,370 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-04-30 10:11:59,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:11:59,372 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-04-30 10:11:59,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:11:59,375 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:11:59,375 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:11:59,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:11:59,376 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:11:59,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:11:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:11:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2025-04-30 10:11:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-04-30 10:11:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-04-30 10:11:59,389 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 37 [2025-04-30 10:11:59,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:11:59,389 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-04-30 10:11:59,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:11:59,389 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-04-30 10:11:59,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:11:59,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:11:59,391 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:11:59,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:11:59,591 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,SelfDestructingSolverStorable1 [2025-04-30 10:11:59,595 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:11:59,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:11:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2061494342, now seen corresponding path program 1 times [2025-04-30 10:11:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:11:59,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506744481] [2025-04-30 10:11:59,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:11:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:11:59,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:11:59,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:11:59,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:11:59,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:11:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:11:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:11:59,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506744481] [2025-04-30 10:11:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506744481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:11:59,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997786405] [2025-04-30 10:11:59,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:11:59,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:11:59,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:11:59,718 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:11:59,720 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:11:59,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:11:59,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:11:59,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:11:59,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:11:59,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:11:59,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:11:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:11:59,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:11:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:11:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997786405] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:11:59,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:11:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-04-30 10:11:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379191777] [2025-04-30 10:11:59,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:11:59,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:11:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:11:59,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:11:59,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:11:59,924 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-30 10:11:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:11:59,979 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-04-30 10:11:59,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:11:59,979 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 37 [2025-04-30 10:11:59,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:11:59,980 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:11:59,980 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:11:59,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:11:59,981 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:11:59,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:11:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:11:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-04-30 10:11:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-30 10:11:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-04-30 10:11:59,984 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 37 [2025-04-30 10:11:59,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:11:59,984 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-04-30 10:11:59,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-30 10:11:59,984 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-04-30 10:11:59,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:11:59,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:11:59,985 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:11:59,991 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:12:00,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:00,186 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:00,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash 807475962, now seen corresponding path program 1 times [2025-04-30 10:12:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:00,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662362021] [2025-04-30 10:12:00,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:00,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:00,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:12:00,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:12:00,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:00,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:12:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:00,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662362021] [2025-04-30 10:12:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662362021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:12:00,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:12:00,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:12:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87952432] [2025-04-30 10:12:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:12:00,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:12:00,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:00,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:12:00,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:12:00,627 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:12:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:00,771 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-04-30 10:12:00,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:12:00,771 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-04-30 10:12:00,772 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:00,772 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:12:00,772 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:12:00,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:12:00,773 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:00,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 72 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:12:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:12:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-04-30 10:12:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-30 10:12:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-04-30 10:12:00,780 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2025-04-30 10:12:00,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:00,781 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-04-30 10:12:00,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:12:00,781 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-04-30 10:12:00,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:12:00,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:00,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:00,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:12:00,782 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:00,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 864734264, now seen corresponding path program 1 times [2025-04-30 10:12:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:00,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113135604] [2025-04-30 10:12:00,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:00,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:12:00,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:12:00,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:00,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:12:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:00,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113135604] [2025-04-30 10:12:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113135604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:12:00,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:12:00,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:12:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508956213] [2025-04-30 10:12:00,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:12:00,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:12:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:00,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:12:00,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:12:00,911 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:12:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:00,962 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2025-04-30 10:12:00,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:12:00,963 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-04-30 10:12:00,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:00,963 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:12:00,965 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:12:00,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:12:00,966 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:00,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:12:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:12:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-04-30 10:12:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-30 10:12:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-04-30 10:12:00,975 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 37 [2025-04-30 10:12:00,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:00,975 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-04-30 10:12:00,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-30 10:12:00,976 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-04-30 10:12:00,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:12:00,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:00,976 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:00,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:12:00,978 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:00,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash -577592461, now seen corresponding path program 1 times [2025-04-30 10:12:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:00,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752930030] [2025-04-30 10:12:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:00,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:12:01,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:12:01,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:01,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:12:01,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:01,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752930030] [2025-04-30 10:12:01,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752930030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:01,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464766039] [2025-04-30 10:12:01,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:01,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:01,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:01,946 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:12:01,948 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:12:02,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:12:02,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:12:02,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:02,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:02,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-30 10:12:02,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:02,075 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:12:02,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-04-30 10:12:02,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:12:02,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:12:02,270 INFO L325 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-04-30 10:12:02,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2025-04-30 10:12:02,288 INFO L325 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-04-30 10:12:02,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-30 10:12:02,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-04-30 10:12:02,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:12:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:12:02,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464766039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:02,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:12:02,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2025-04-30 10:12:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380944384] [2025-04-30 10:12:02,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:02,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:12:02,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:02,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:12:02,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:12:02,632 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:12:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:03,221 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-04-30 10:12:03,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:12:03,222 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-04-30 10:12:03,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:03,222 INFO L225 Difference]: With dead ends: 47 [2025-04-30 10:12:03,222 INFO L226 Difference]: Without dead ends: 42 [2025-04-30 10:12:03,223 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:12:03,224 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:03,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 225 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:12:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-30 10:12:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-04-30 10:12:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-30 10:12:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-04-30 10:12:03,228 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 41 [2025-04-30 10:12:03,229 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:03,229 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-04-30 10:12:03,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:12:03,229 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-04-30 10:12:03,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:12:03,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:03,230 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:03,236 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:12:03,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:03,434 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:03,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash -307673236, now seen corresponding path program 2 times [2025-04-30 10:12:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:03,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840438749] [2025-04-30 10:12:03,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:12:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:03,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:12:03,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:12:03,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:12:03,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:12:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:05,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840438749] [2025-04-30 10:12:05,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840438749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:05,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924372993] [2025-04-30 10:12:05,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:12:05,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:05,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:05,213 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:12:05,215 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:12:05,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:12:05,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:12:05,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:12:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:05,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-04-30 10:12:05,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:05,358 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:12:05,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-04-30 10:12:05,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:12:05,619 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:12:05,750 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:12:05,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-30 10:12:05,768 INFO L325 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-04-30 10:12:05,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2025-04-30 10:12:05,883 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-30 10:12:05,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-30 10:12:06,000 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:12:06,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-30 10:12:06,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:06,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2025-04-30 10:12:06,028 INFO L325 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-04-30 10:12:06,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2025-04-30 10:12:06,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:06,041 INFO L325 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-04-30 10:12:06,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2025-04-30 10:12:06,327 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:12:06,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2025-04-30 10:12:06,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:12:06,384 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:12:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:12:06,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:06,673 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:12:06,673 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-04-30 10:12:06,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:12:06,677 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-04-30 10:12:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924372993] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:06,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:12:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 35 [2025-04-30 10:12:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190872904] [2025-04-30 10:12:06,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:06,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:12:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:06,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:12:06,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:12:06,785 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 31 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:12:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:08,269 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-04-30 10:12:08,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:12:08,269 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 31 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 45 [2025-04-30 10:12:08,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:08,270 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:12:08,270 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:12:08,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=333, Invalid=3327, Unknown=0, NotChecked=0, Total=3660 [2025-04-30 10:12:08,272 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 133 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:08,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 316 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:12:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:12:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-04-30 10:12:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-30 10:12:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-04-30 10:12:08,282 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 45 [2025-04-30 10:12:08,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:08,285 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-04-30 10:12:08,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 31 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:12:08,285 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-04-30 10:12:08,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:12:08,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:08,285 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:08,294 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:12:08,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:08,486 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:08,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash -250414934, now seen corresponding path program 1 times [2025-04-30 10:12:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:08,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113469514] [2025-04-30 10:12:08,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:12:08,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:12:08,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:08,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:12:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:09,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113469514] [2025-04-30 10:12:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113469514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:09,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304239806] [2025-04-30 10:12:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:09,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:09,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:09,185 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:12:09,187 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:12:09,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:12:09,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:12:09,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:09,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:09,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-30 10:12:09,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:09,339 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:12:09,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:12:09,408 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:12:09,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2025-04-30 10:12:09,484 INFO L325 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-04-30 10:12:09,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2025-04-30 10:12:09,501 INFO L325 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-04-30 10:12:09,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-30 10:12:09,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:12:09,609 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-30 10:12:09,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2025-04-30 10:12:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:12:09,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:09,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:12:09,742 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-04-30 10:12:09,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304239806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:09,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:12:09,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2025-04-30 10:12:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750764090] [2025-04-30 10:12:09,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:09,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:12:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:09,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:12:09,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:12:09,775 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 20 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:12:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:10,464 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-04-30 10:12:10,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:12:10,465 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 20 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 45 [2025-04-30 10:12:10,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:10,465 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:12:10,465 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:12:10,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2025-04-30 10:12:10,466 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:10,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 229 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:12:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:12:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2025-04-30 10:12:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:12:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-04-30 10:12:10,472 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 45 [2025-04-30 10:12:10,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:10,473 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-04-30 10:12:10,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 20 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:12:10,473 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-04-30 10:12:10,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:12:10,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:10,473 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:10,479 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:12:10,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:10,674 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:10,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 158025445, now seen corresponding path program 3 times [2025-04-30 10:12:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:10,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321513202] [2025-04-30 10:12:10,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:12:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:10,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 4 equivalence classes. [2025-04-30 10:12:10,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:12:10,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:12:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:12:10,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:12:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:12:10,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:12:10,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:10,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:12:10,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:12:10,765 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:12:10,767 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-30 10:12:10,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:12:10,772 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-04-30 10:12:10,832 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:12:10,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:12:10 BoogieIcfgContainer [2025-04-30 10:12:10,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:12:10,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:12:10,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:12:10,835 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:12:10,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:11:57" (3/4) ... [2025-04-30 10:12:10,835 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:12:10,895 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 21. [2025-04-30 10:12:10,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:12:10,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:12:10,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:12:10,945 INFO L158 Benchmark]: Toolchain (without parser) took 13966.58ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 111.5MB in the beginning and 291.9MB in the end (delta: -180.4MB). Peak memory consumption was 175.5MB. Max. memory is 16.1GB. [2025-04-30 10:12:10,945 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:12:10,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.61ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 90.7MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:12:10,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.75ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:12:10,945 INFO L158 Benchmark]: Boogie Preprocessor took 40.63ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:12:10,946 INFO L158 Benchmark]: RCFGBuilder took 332.74ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 72.3MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:12:10,946 INFO L158 Benchmark]: TraceAbstraction took 13121.24ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 71.8MB in the beginning and 300.3MB in the end (delta: -228.5MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2025-04-30 10:12:10,946 INFO L158 Benchmark]: Witness Printer took 110.13ms. Allocated memory is still 503.3MB. Free memory was 300.3MB in the beginning and 291.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:12:10,946 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.61ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 90.7MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.75ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.63ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.74ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 72.3MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13121.24ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 71.8MB in the beginning and 300.3MB in the end (delta: -228.5MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. * Witness Printer took 110.13ms. Allocated memory is still 503.3MB. Free memory was 300.3MB in the beginning and 291.9MB in the end (delta: 8.4MB). 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\at(head, Pre)={0:0}, \at(k, Pre)=2, head={0:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\at(head, Pre)={0:0}, \at(k, Pre)=2, head={0:0}, k=2, l={-1:0}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\at(head, Pre)={0:0}, \at(k, Pre)=2, head={0:0}, k=2, l={-1:0}] [L550] head = l [L551] return 0; VAL [\at(head, Pre)={0:0}, \at(k, Pre)=2, \result=0, head={-1:0}, k=2] [L556] RET insert_list(mylist,2) VAL [head={-1:0}, mylist={59:58}] [L557] CALL insert_list(mylist,5) VAL [\at(head, Pre)={-1:0}, \at(k, Pre)=5, head={-1:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\at(head, Pre)={-1:0}, \at(k, Pre)=5, head={-1:0}, k=5, l={-5:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\at(head, Pre)={-1:0}, \at(k, Pre)=5, head={-1:0}, l={-5:0}] [L550] head = l [L551] return 0; VAL [\at(head, Pre)={-1:0}, \at(k, Pre)=5, \result=0, head={-5:0}] [L557] RET insert_list(mylist,5) VAL [head={-5:0}, mylist={59:58}] [L558] CALL insert_list(mylist,1) VAL [\at(head, Pre)={-5:0}, \at(k, Pre)=1, head={-5:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\at(head, Pre)={-5:0}, \at(k, Pre)=1, head={-5:0}, k=1, l={-3:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\at(head, Pre)={-5:0}, \at(k, Pre)=1, head={-5:0}, l={-3:0}] [L550] head = l [L551] return 0; VAL [\at(head, Pre)={-5:0}, \at(k, Pre)=1, \result=0, head={-3:0}] [L558] RET insert_list(mylist,1) VAL [head={-3:0}, mylist={59:58}] [L559] CALL insert_list(mylist,3) VAL [\at(head, Pre)={-3:0}, \at(k, Pre)=3, head={-3:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\at(head, Pre)={-3:0}, \at(k, Pre)=3, head={-3:0}, k=3, l={-4:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\at(head, Pre)={-3:0}, \at(k, Pre)=3, head={-3:0}, l={-4:0}] [L550] head = l [L551] return 0; VAL [\at(head, Pre)={-3:0}, \at(k, Pre)=3, \result=0, head={-4:0}] [L559] RET insert_list(mylist,3) VAL [head={-4:0}, mylist={59:58}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [head={-4:0}, k=2, l={-4:0}] [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [\result={-1:0}, head={-4:0}, k=2] [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [head={-4:0}] [L15] reach_error() VAL [head={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 41 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 1134 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 965 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1700 IncrementalHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 169 mSDtfsCounter, 1700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 576 ConstructedInterpolants, 8 QuantifiedInterpolants, 6356 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 334/496 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 proved your program to be incorrect! [2025-04-30 10:12:10,960 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE