./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:15:42,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:15:42,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:15:42,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:15:42,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:15:42,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:15:42,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:15:42,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:15:42,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:15:42,269 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:15:42,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:15:42,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:15:42,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:15:42,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:15:42,269 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:15:42,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:15:42,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:15:42,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:42,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:42,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:42,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:15:42,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:15:42,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:15:42,273 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-jdk21/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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2025-01-09 04:15:42,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:15:42,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:15:42,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:15:42,493 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:15:42,498 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:15:42,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2025-01-09 04:15:43,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9cb88109/02b0bf800c9540fba582089adba22027/FLAG77a4c47f2 [2025-01-09 04:15:43,776 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:15:43,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2025-01-09 04:15:43,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9cb88109/02b0bf800c9540fba582089adba22027/FLAG77a4c47f2 [2025-01-09 04:15:43,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9cb88109/02b0bf800c9540fba582089adba22027 [2025-01-09 04:15:43,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:15:43,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:15:43,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:43,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:15:43,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:15:43,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:43,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5c9212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43, skipping insertion in model container [2025-01-09 04:15:43,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:43,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:15:43,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2025-01-09 04:15:43,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:43,958 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:15:43,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2025-01-09 04:15:43,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:43,997 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:15:43,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43 WrapperNode [2025-01-09 04:15:43,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:44,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:44,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:15:44,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:15:44,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,025 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 192 [2025-01-09 04:15:44,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:44,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:15:44,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:15:44,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:15:44,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,049 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:15:44,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:15:44,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:15:44,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:15:44,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:15:44,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (1/1) ... [2025-01-09 04:15:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:44,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:44,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:15:44,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:15:44,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:15:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:15:44,131 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:15:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:15:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:15:44,131 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:15:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-01-09 04:15:44,131 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-01-09 04:15:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:15:44,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:15:44,188 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:15:44,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:15:44,349 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 04:15:44,349 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:15:44,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:15:44,358 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 04:15:44,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:44 BoogieIcfgContainer [2025-01-09 04:15:44,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:15:44,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:15:44,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:15:44,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:15:44,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:15:43" (1/3) ... [2025-01-09 04:15:44,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57eea40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:44, skipping insertion in model container [2025-01-09 04:15:44,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:43" (2/3) ... [2025-01-09 04:15:44,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57eea40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:44, skipping insertion in model container [2025-01-09 04:15:44,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:44" (3/3) ... [2025-01-09 04:15:44,367 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2025-01-09 04:15:44,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:15:44,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2.c that has 4 procedures, 70 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 04:15:44,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:15:44,433 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7970f06f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:15:44,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:15:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 62 states have internal predecessors, (89), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:15:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:15:44,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:44,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:44,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1169216459, now seen corresponding path program 1 times [2025-01-09 04:15:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421136838] [2025-01-09 04:15:44,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:44,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:15:44,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:15:44,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:44,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421136838] [2025-01-09 04:15:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421136838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:44,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788791141] [2025-01-09 04:15:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:44,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:44,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:44,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:44,603 INFO L87 Difference]: Start difference. First operand has 70 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 62 states have internal predecessors, (89), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:15:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:44,656 INFO L93 Difference]: Finished difference Result 191 states and 285 transitions. [2025-01-09 04:15:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:44,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-01-09 04:15:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:44,662 INFO L225 Difference]: With dead ends: 191 [2025-01-09 04:15:44,663 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 04:15:44,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:44,666 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 75 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:44,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 186 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 04:15:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2025-01-09 04:15:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-09 04:15:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-01-09 04:15:44,709 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 40 [2025-01-09 04:15:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:44,713 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-01-09 04:15:44,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:15:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-01-09 04:15:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 04:15:44,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:44,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:44,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:15:44,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:44,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash -517294281, now seen corresponding path program 1 times [2025-01-09 04:15:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505484220] [2025-01-09 04:15:44,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 04:15:44,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 04:15:44,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:44,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505484220] [2025-01-09 04:15:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505484220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392387880] [2025-01-09 04:15:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:44,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:44,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:44,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:44,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:44,782 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:15:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:44,825 INFO L93 Difference]: Finished difference Result 308 states and 436 transitions. [2025-01-09 04:15:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-01-09 04:15:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:44,827 INFO L225 Difference]: With dead ends: 308 [2025-01-09 04:15:44,827 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 04:15:44,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:44,828 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 66 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:44,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 04:15:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 176. [2025-01-09 04:15:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.4129032258064516) internal successors, (219), 156 states have internal predecessors, (219), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2025-01-09 04:15:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2025-01-09 04:15:44,854 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 41 [2025-01-09 04:15:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:44,854 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2025-01-09 04:15:44,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:15:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2025-01-09 04:15:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:15:44,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:44,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:44,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:15:44,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:44,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2062564152, now seen corresponding path program 1 times [2025-01-09 04:15:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648896137] [2025-01-09 04:15:44,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:44,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:15:44,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:15:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648896137] [2025-01-09 04:15:44,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648896137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:44,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:44,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:44,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969836595] [2025-01-09 04:15:44,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:44,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:44,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:44,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:44,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:44,946 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:15:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:44,991 INFO L93 Difference]: Finished difference Result 501 states and 708 transitions. [2025-01-09 04:15:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:44,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-01-09 04:15:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:44,995 INFO L225 Difference]: With dead ends: 501 [2025-01-09 04:15:44,996 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 04:15:44,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:44,998 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 66 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:44,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 172 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 04:15:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 321. [2025-01-09 04:15:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 282 states have (on average 1.3794326241134751) internal successors, (389), 285 states have internal predecessors, (389), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (32), 20 states have call predecessors, (32), 22 states have call successors, (32) [2025-01-09 04:15:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 445 transitions. [2025-01-09 04:15:45,037 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 445 transitions. Word has length 42 [2025-01-09 04:15:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:45,037 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 445 transitions. [2025-01-09 04:15:45,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:15:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 445 transitions. [2025-01-09 04:15:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:15:45,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:45,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:45,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:15:45,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:45,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1399295794, now seen corresponding path program 1 times [2025-01-09 04:15:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:45,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299585975] [2025-01-09 04:15:45,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:45,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:15:45,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:15:45,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299585975] [2025-01-09 04:15:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299585975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:45,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497320944] [2025-01-09 04:15:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:45,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:45,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:45,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:45,144 INFO L87 Difference]: Start difference. First operand 321 states and 445 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:15:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:45,189 INFO L93 Difference]: Finished difference Result 792 states and 1101 transitions. [2025-01-09 04:15:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-01-09 04:15:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:45,194 INFO L225 Difference]: With dead ends: 792 [2025-01-09 04:15:45,196 INFO L226 Difference]: Without dead ends: 479 [2025-01-09 04:15:45,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:45,197 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:45,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 221 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-09 04:15:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-01-09 04:15:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 418 states have (on average 1.3277511961722488) internal successors, (555), 421 states have internal predecessors, (555), 38 states have call successors, (38), 23 states have call predecessors, (38), 22 states have return successors, (54), 34 states have call predecessors, (54), 36 states have call successors, (54) [2025-01-09 04:15:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 647 transitions. [2025-01-09 04:15:45,247 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 647 transitions. Word has length 57 [2025-01-09 04:15:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:45,247 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 647 transitions. [2025-01-09 04:15:45,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:15:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 647 transitions. [2025-01-09 04:15:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:15:45,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:45,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:45,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:15:45,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:45,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -661567875, now seen corresponding path program 1 times [2025-01-09 04:15:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263695843] [2025-01-09 04:15:45,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:45,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:45,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:45,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:15:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263695843] [2025-01-09 04:15:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263695843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600190620] [2025-01-09 04:15:45,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:45,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:45,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:15:45,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:45,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:45,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:45,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:15:45,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600190620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:45,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 04:15:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212382875] [2025-01-09 04:15:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:45,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:45,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:45,535 INFO L87 Difference]: Start difference. First operand 479 states and 647 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:15:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:45,565 INFO L93 Difference]: Finished difference Result 981 states and 1324 transitions. [2025-01-09 04:15:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-01-09 04:15:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:45,568 INFO L225 Difference]: With dead ends: 981 [2025-01-09 04:15:45,568 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 04:15:45,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:45,570 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:45,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 04:15:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-01-09 04:15:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 523 states have (on average 1.3040152963671128) internal successors, (682), 526 states have internal predecessors, (682), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (66), 42 states have call predecessors, (66), 44 states have call successors, (66) [2025-01-09 04:15:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 794 transitions. [2025-01-09 04:15:45,592 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 794 transitions. Word has length 62 [2025-01-09 04:15:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:45,592 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 794 transitions. [2025-01-09 04:15:45,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:15:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 794 transitions. [2025-01-09 04:15:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:15:45,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:45,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:45,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:15:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:45,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:45,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash -261576676, now seen corresponding path program 1 times [2025-01-09 04:15:45,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:45,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779159248] [2025-01-09 04:15:45,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:45,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:45,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:45,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:15:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:45,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779159248] [2025-01-09 04:15:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779159248] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205341669] [2025-01-09 04:15:45,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:45,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:45,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:15:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:45,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:45,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 04:15:45,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:46,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:15:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205341669] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:46,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:15:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-01-09 04:15:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135233986] [2025-01-09 04:15:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:46,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:46,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:46,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:46,066 INFO L87 Difference]: Start difference. First operand 598 states and 794 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:15:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:46,139 INFO L93 Difference]: Finished difference Result 648 states and 856 transitions. [2025-01-09 04:15:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2025-01-09 04:15:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:46,142 INFO L225 Difference]: With dead ends: 648 [2025-01-09 04:15:46,142 INFO L226 Difference]: Without dead ends: 645 [2025-01-09 04:15:46,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:15:46,143 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:46,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 174 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-09 04:15:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 597. [2025-01-09 04:15:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 523 states have (on average 1.3001912045889101) internal successors, (680), 525 states have internal predecessors, (680), 45 states have call successors, (45), 29 states have call predecessors, (45), 28 states have return successors, (66), 42 states have call predecessors, (66), 44 states have call successors, (66) [2025-01-09 04:15:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 791 transitions. [2025-01-09 04:15:46,169 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 791 transitions. Word has length 62 [2025-01-09 04:15:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:46,170 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 791 transitions. [2025-01-09 04:15:46,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:15:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 791 transitions. [2025-01-09 04:15:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:15:46,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:46,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:46,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:15:46,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:46,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash 480734281, now seen corresponding path program 1 times [2025-01-09 04:15:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:46,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393248136] [2025-01-09 04:15:46,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:15:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:15:46,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:15:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393248136] [2025-01-09 04:15:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393248136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560406218] [2025-01-09 04:15:46,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:46,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:46,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:46,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:15:46,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:15:46,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:15:46,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:46,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:46,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 04:15:46,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:46,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:15:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560406218] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:46,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-01-09 04:15:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320471794] [2025-01-09 04:15:46,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:46,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:15:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:46,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:15:46,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:46,731 INFO L87 Difference]: Start difference. First operand 597 states and 791 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 04:15:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:46,994 INFO L93 Difference]: Finished difference Result 1834 states and 2468 transitions. [2025-01-09 04:15:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:15:46,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 63 [2025-01-09 04:15:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:46,998 INFO L225 Difference]: With dead ends: 1834 [2025-01-09 04:15:46,999 INFO L226 Difference]: Without dead ends: 1377 [2025-01-09 04:15:47,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:15:47,000 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 247 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:47,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1235 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-01-09 04:15:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 932. [2025-01-09 04:15:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 822 states have (on average 1.2834549878345498) internal successors, (1055), 829 states have internal predecessors, (1055), 65 states have call successors, (65), 43 states have call predecessors, (65), 44 states have return successors, (97), 59 states have call predecessors, (97), 64 states have call successors, (97) [2025-01-09 04:15:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1217 transitions. [2025-01-09 04:15:47,079 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1217 transitions. Word has length 63 [2025-01-09 04:15:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:47,084 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1217 transitions. [2025-01-09 04:15:47,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 04:15:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1217 transitions. [2025-01-09 04:15:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:15:47,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:47,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:47,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:15:47,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:47,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:47,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:47,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1953623578, now seen corresponding path program 1 times [2025-01-09 04:15:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020660140] [2025-01-09 04:15:47,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:47,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:15:47,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:15:47,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 04:15:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020660140] [2025-01-09 04:15:47,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020660140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973489851] [2025-01-09 04:15:47,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:47,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:47,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:15:47,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:15:47,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:15:47,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:15:47,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:15:47,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973489851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:47,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:47,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528125445] [2025-01-09 04:15:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:47,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:47,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:47,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:47,471 INFO L87 Difference]: Start difference. First operand 932 states and 1217 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:15:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:47,503 INFO L93 Difference]: Finished difference Result 1532 states and 2012 transitions. [2025-01-09 04:15:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:47,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 81 [2025-01-09 04:15:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:47,507 INFO L225 Difference]: With dead ends: 1532 [2025-01-09 04:15:47,507 INFO L226 Difference]: Without dead ends: 820 [2025-01-09 04:15:47,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 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-01-09 04:15:47,509 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:47,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 188 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-01-09 04:15:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 811. [2025-01-09 04:15:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 715 states have (on average 1.274125874125874) internal successors, (911), 723 states have internal predecessors, (911), 57 states have call successors, (57), 37 states have call predecessors, (57), 38 states have return successors, (85), 50 states have call predecessors, (85), 56 states have call successors, (85) [2025-01-09 04:15:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1053 transitions. [2025-01-09 04:15:47,541 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1053 transitions. Word has length 81 [2025-01-09 04:15:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:47,541 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1053 transitions. [2025-01-09 04:15:47,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:15:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1053 transitions. [2025-01-09 04:15:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:15:47,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:47,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:47,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:47,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 04:15:47,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:47,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash -823400637, now seen corresponding path program 1 times [2025-01-09 04:15:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130591953] [2025-01-09 04:15:47,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:47,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:15:47,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:15:47,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 04:15:47,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130591953] [2025-01-09 04:15:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130591953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657419099] [2025-01-09 04:15:47,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:47,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:47,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:15:47,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:15:47,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:15:47,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:15:47,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:47,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:15:47,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657419099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816044896] [2025-01-09 04:15:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:47,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:47,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:47,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:47,887 INFO L87 Difference]: Start difference. First operand 811 states and 1053 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:15:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:47,911 INFO L93 Difference]: Finished difference Result 1160 states and 1494 transitions. [2025-01-09 04:15:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 95 [2025-01-09 04:15:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:47,913 INFO L225 Difference]: With dead ends: 1160 [2025-01-09 04:15:47,913 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:15:47,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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-01-09 04:15:47,915 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 60 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:47,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 195 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:15:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:15:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:15:47,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2025-01-09 04:15:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:47,917 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:15:47,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:15:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:15:47,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:15:47,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:15:47,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:48,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:48,122 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:48,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:15:49,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:15:49,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:15:49 BoogieIcfgContainer [2025-01-09 04:15:49,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:15:49,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:15:49,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:15:49,492 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:15:49,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:44" (3/4) ... [2025-01-09 04:15:49,493 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:15:49,497 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2025-01-09 04:15:49,497 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-01-09 04:15:49,497 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2025-01-09 04:15:49,500 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 04:15:49,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 04:15:49,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 04:15:49,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:15:49,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:15:49,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:15:49,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:15:49,569 INFO L158 Benchmark]: Toolchain (without parser) took 5766.73ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 164.6MB in the end (delta: -5.1MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2025-01-09 04:15:49,569 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:15:49,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.72ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 146.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:15:49,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.43ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:15:49,570 INFO L158 Benchmark]: Boogie Preprocessor took 44.19ms. Allocated memory is still 201.3MB. Free memory was 145.1MB in the beginning and 143.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:15:49,570 INFO L158 Benchmark]: RCFGBuilder took 288.93ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 127.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:15:49,570 INFO L158 Benchmark]: TraceAbstraction took 5130.01ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 61.8MB in the end (delta: 64.6MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2025-01-09 04:15:49,570 INFO L158 Benchmark]: Witness Printer took 77.09ms. Allocated memory is still 201.3MB. Free memory was 61.8MB in the beginning and 164.6MB in the end (delta: -102.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:15:49,571 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.15ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.72ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 146.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.43ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.19ms. Allocated memory is still 201.3MB. Free memory was 145.1MB in the beginning and 143.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.93ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 127.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5130.01ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 61.8MB in the end (delta: 64.6MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 77.09ms. Allocated memory is still 201.3MB. Free memory was 61.8MB in the beginning and 164.6MB in the end (delta: -102.8MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 829 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 829 mSDsluCounter, 2716 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1631 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 232 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1085 mSDtfsCounter, 232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=932occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 543 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1015 ConstructedInterpolants, 0 QuantifiedInterpolants, 1807 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1309 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 255/337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Location Invariant Derived location invariant: (((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) || (((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (p_dw_pc <= 0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0))) || (((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0))) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (p_dw_pc <= 0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (p_dw_pc <= 0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (p_dw_pc <= 0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (p_dw_pc <= 0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 160]: Location Invariant Derived location invariant: ((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:15:49,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE