./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:55:42,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:55:42,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:55:42,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:55:42,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:55:42,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:55:42,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:55:42,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:55:42,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:55:42,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:55:42,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:55:42,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:55:42,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:55:42,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:55:42,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:55:42,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:55:42,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:55:42,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:55:42,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:55:42,156 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 [2025-03-08 06:55:42,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:55:42,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:55:42,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:55:42,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:55:42,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:55:42,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2025-03-08 06:55:43,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e697656/e7123f1b7a2b475a804fc5840c4eef22/FLAGc6a86c0a6 [2025-03-08 06:55:44,097 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:55:44,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2025-03-08 06:55:44,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e697656/e7123f1b7a2b475a804fc5840c4eef22/FLAGc6a86c0a6 [2025-03-08 06:55:44,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e697656/e7123f1b7a2b475a804fc5840c4eef22 [2025-03-08 06:55:44,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:55:44,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:55:44,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:55:44,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:55:44,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:55:44,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:55:44" (1/1) ... [2025-03-08 06:55:44,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56dd87d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:44, skipping insertion in model container [2025-03-08 06:55:44,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:55:44" (1/1) ... [2025-03-08 06:55:44,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:55:45,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2025-03-08 06:55:45,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2025-03-08 06:55:45,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:55:45,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:55:46,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2025-03-08 06:55:46,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2025-03-08 06:55:46,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:55:46,341 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:55:46,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46 WrapperNode [2025-03-08 06:55:46,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:55:46,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:55:46,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:55:46,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:55:46,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:46,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:46,739 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12564 [2025-03-08 06:55:46,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:55:46,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:55:46,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:55:46,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:55:46,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:46,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:46,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:46,889 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-03-08 06:55:46,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:46,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:47,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:47,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:47,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:47,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:47,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:55:47,268 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:55:47,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:55:47,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:55:47,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (1/1) ... [2025-03-08 06:55:47,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:55:47,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:55:47,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:55:47,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:55:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:55:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:55:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:55:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:55:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:55:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:55:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:55:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:55:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:55:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:55:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:55:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:55:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:55:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:55:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:55:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:55:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:55:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:55:47,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:55:47,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:55:53,361 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:55:53,362 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:55:53,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:55:53,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:55:53,364 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:55:53,364 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:55:53,365 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:55:53,559 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2025-03-08 06:55:53,560 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:55:53,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:55:53,609 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:55:53,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:55:53 BoogieIcfgContainer [2025-03-08 06:55:53,609 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:55:53,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:55:53,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:55:53,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:55:53,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:55:44" (1/3) ... [2025-03-08 06:55:53,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7649e619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:55:53, skipping insertion in model container [2025-03-08 06:55:53,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:55:46" (2/3) ... [2025-03-08 06:55:53,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7649e619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:55:53, skipping insertion in model container [2025-03-08 06:55:53,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:55:53" (3/3) ... [2025-03-08 06:55:53,619 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.01.cil-2.c [2025-03-08 06:55:53,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:55:53,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.01.cil-2.c that has 8 procedures, 2296 locations, 1 initial locations, 5 loop locations, and 2 error locations. [2025-03-08 06:55:53,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:55:53,729 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;@5b24e1fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:55:53,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:55:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 2296 states, 2270 states have (on average 1.8568281938325992) internal successors, (4215), 2274 states have internal predecessors, (4215), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 06:55:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:55:53,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:53,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:53,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:53,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1823629984, now seen corresponding path program 1 times [2025-03-08 06:55:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637163153] [2025-03-08 06:55:53,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:53,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:55:53,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:55:53,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:53,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:55:54,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637163153] [2025-03-08 06:55:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637163153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:54,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:55:54,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:55:54,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875493582] [2025-03-08 06:55:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:54,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:55:54,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:54,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:55:54,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:55:54,041 INFO L87 Difference]: Start difference. First operand has 2296 states, 2270 states have (on average 1.8568281938325992) internal successors, (4215), 2274 states have internal predecessors, (4215), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:54,393 INFO L93 Difference]: Finished difference Result 4687 states and 8645 transitions. [2025-03-08 06:55:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:55:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-08 06:55:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:54,412 INFO L225 Difference]: With dead ends: 4687 [2025-03-08 06:55:54,412 INFO L226 Difference]: Without dead ends: 2330 [2025-03-08 06:55:54,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:54,423 INFO L435 NwaCegarLoop]: 4154 mSDtfsCounter, 4253 mSDsluCounter, 8354 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4262 SdHoareTripleChecker+Valid, 12508 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:54,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4262 Valid, 12508 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:55:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-08 06:55:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2321. [2025-03-08 06:55:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2279 states have (on average 1.8398420359806933) internal successors, (4193), 2283 states have internal predecessors, (4193), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-08 06:55:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4246 transitions. [2025-03-08 06:55:54,541 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4246 transitions. Word has length 56 [2025-03-08 06:55:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:54,542 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4246 transitions. [2025-03-08 06:55:54,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4246 transitions. [2025-03-08 06:55:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:55:54,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:54,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:54,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:55:54,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:54,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -591412898, now seen corresponding path program 1 times [2025-03-08 06:55:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:54,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785591087] [2025-03-08 06:55:54,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:54,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:55:54,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:55:54,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:54,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:55:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785591087] [2025-03-08 06:55:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785591087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:55:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:55:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296914583] [2025-03-08 06:55:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:55:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:54,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:55:54,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:55:54,695 INFO L87 Difference]: Start difference. First operand 2321 states and 4246 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:54,861 INFO L93 Difference]: Finished difference Result 2524 states and 4543 transitions. [2025-03-08 06:55:54,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:55:54,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-08 06:55:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:54,871 INFO L225 Difference]: With dead ends: 2524 [2025-03-08 06:55:54,873 INFO L226 Difference]: Without dead ends: 2333 [2025-03-08 06:55:54,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:54,877 INFO L435 NwaCegarLoop]: 4066 mSDtfsCounter, 4133 mSDsluCounter, 8083 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4142 SdHoareTripleChecker+Valid, 12149 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:54,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4142 Valid, 12149 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:55:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2025-03-08 06:55:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2321. [2025-03-08 06:55:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2279 states have (on average 1.838964458095656) internal successors, (4191), 2283 states have internal predecessors, (4191), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-08 06:55:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4244 transitions. [2025-03-08 06:55:54,926 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4244 transitions. Word has length 56 [2025-03-08 06:55:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:54,926 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4244 transitions. [2025-03-08 06:55:54,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4244 transitions. [2025-03-08 06:55:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:55:54,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:54,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:54,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:55:54,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:54,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1040109537, now seen corresponding path program 1 times [2025-03-08 06:55:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:54,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759883158] [2025-03-08 06:55:54,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:54,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:55:54,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:55:54,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:54,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:55:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:55,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759883158] [2025-03-08 06:55:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759883158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:55,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:55:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:55:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294643868] [2025-03-08 06:55:55,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:55,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:55:55,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:55,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:55:55,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:55,038 INFO L87 Difference]: Start difference. First operand 2321 states and 4244 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:55,359 INFO L93 Difference]: Finished difference Result 2632 states and 4686 transitions. [2025-03-08 06:55:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:55:55,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-08 06:55:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:55,368 INFO L225 Difference]: With dead ends: 2632 [2025-03-08 06:55:55,369 INFO L226 Difference]: Without dead ends: 2441 [2025-03-08 06:55:55,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:55:55,371 INFO L435 NwaCegarLoop]: 4143 mSDtfsCounter, 4209 mSDsluCounter, 12379 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4220 SdHoareTripleChecker+Valid, 16522 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:55,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4220 Valid, 16522 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:55:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2025-03-08 06:55:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2405. [2025-03-08 06:55:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2347 states have (on average 1.8274392841925864) internal successors, (4289), 2352 states have internal predecessors, (4289), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-08 06:55:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 4363 transitions. [2025-03-08 06:55:55,495 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 4363 transitions. Word has length 56 [2025-03-08 06:55:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:55,495 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 4363 transitions. [2025-03-08 06:55:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 4363 transitions. [2025-03-08 06:55:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:55:55,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:55,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:55:55,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -916036290, now seen corresponding path program 1 times [2025-03-08 06:55:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822797395] [2025-03-08 06:55:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:55,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:55:55,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:55:55,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:55,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:55:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:55,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822797395] [2025-03-08 06:55:55,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822797395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:55,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:55:55,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:55:55,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804252338] [2025-03-08 06:55:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:55,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:55:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:55,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:55:55,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:55:55,575 INFO L87 Difference]: Start difference. First operand 2405 states and 4363 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:55,760 INFO L93 Difference]: Finished difference Result 2690 states and 4772 transitions. [2025-03-08 06:55:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:55:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-08 06:55:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:55,771 INFO L225 Difference]: With dead ends: 2690 [2025-03-08 06:55:55,771 INFO L226 Difference]: Without dead ends: 2415 [2025-03-08 06:55:55,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:55,775 INFO L435 NwaCegarLoop]: 4061 mSDtfsCounter, 4127 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12133 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:55,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 12133 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:55:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2025-03-08 06:55:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2405. [2025-03-08 06:55:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2347 states have (on average 1.8261610566680868) internal successors, (4286), 2352 states have internal predecessors, (4286), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-08 06:55:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 4360 transitions. [2025-03-08 06:55:55,847 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 4360 transitions. Word has length 56 [2025-03-08 06:55:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:55,847 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 4360 transitions. [2025-03-08 06:55:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 4360 transitions. [2025-03-08 06:55:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:55:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:55,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:55:55,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:55,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1443270719, now seen corresponding path program 1 times [2025-03-08 06:55:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:55,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507823779] [2025-03-08 06:55:55,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:55,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:55,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:55:55,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:55:55,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:55,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:55:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507823779] [2025-03-08 06:55:55,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507823779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:55,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:55:55,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:55:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009706924] [2025-03-08 06:55:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:55:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:55,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:55:55,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:55:55,898 INFO L87 Difference]: Start difference. First operand 2405 states and 4360 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:56,046 INFO L93 Difference]: Finished difference Result 2921 states and 5102 transitions. [2025-03-08 06:55:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:55:56,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-08 06:55:56,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:56,058 INFO L225 Difference]: With dead ends: 2921 [2025-03-08 06:55:56,059 INFO L226 Difference]: Without dead ends: 2647 [2025-03-08 06:55:56,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:55:56,062 INFO L435 NwaCegarLoop]: 4215 mSDtfsCounter, 4196 mSDsluCounter, 4158 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 8373 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:56,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4196 Valid, 8373 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:55:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2025-03-08 06:55:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2644. [2025-03-08 06:55:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2536 states have (on average 1.788249211356467) internal successors, (4535), 2546 states have internal predecessors, (4535), 66 states have call successors, (66), 37 states have call predecessors, (66), 40 states have return successors, (71), 62 states have call predecessors, (71), 64 states have call successors, (71) [2025-03-08 06:55:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 4672 transitions. [2025-03-08 06:55:56,146 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 4672 transitions. Word has length 56 [2025-03-08 06:55:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:56,146 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 4672 transitions. [2025-03-08 06:55:56,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 4672 transitions. [2025-03-08 06:55:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:55:56,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:56,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:56,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:55:56,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:56,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash 857078616, now seen corresponding path program 1 times [2025-03-08 06:55:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:56,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688086919] [2025-03-08 06:55:56,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:56,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:55:56,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:55:56,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:56,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:55:56,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688086919] [2025-03-08 06:55:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688086919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:55:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746375371] [2025-03-08 06:55:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:56,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:55:56,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:55:56,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:55:56,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:55:56,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:55:56,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:56,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:56,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:55:56,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:55:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:55:56,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:55:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746375371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:55:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:55:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353091062] [2025-03-08 06:55:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:56,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:55:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:56,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:55:56,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:56,363 INFO L87 Difference]: Start difference. First operand 2644 states and 4672 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:55:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:56,438 INFO L93 Difference]: Finished difference Result 3645 states and 6054 transitions. [2025-03-08 06:55:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:55:56,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2025-03-08 06:55:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:56,450 INFO L225 Difference]: With dead ends: 3645 [2025-03-08 06:55:56,450 INFO L226 Difference]: Without dead ends: 3132 [2025-03-08 06:55:56,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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-03-08 06:55:56,454 INFO L435 NwaCegarLoop]: 4105 mSDtfsCounter, 4073 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4073 SdHoareTripleChecker+Valid, 4232 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:56,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4073 Valid, 4232 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:55:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2025-03-08 06:55:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3122. [2025-03-08 06:55:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2918 states have (on average 1.7333790267306375) internal successors, (5058), 2935 states have internal predecessors, (5058), 122 states have call successors, (122), 73 states have call predecessors, (122), 80 states have return successors, (133), 115 states have call predecessors, (133), 120 states have call successors, (133) [2025-03-08 06:55:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5313 transitions. [2025-03-08 06:55:56,542 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5313 transitions. Word has length 90 [2025-03-08 06:55:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:56,542 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 5313 transitions. [2025-03-08 06:55:56,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:55:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5313 transitions. [2025-03-08 06:55:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:55:56,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:56,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:56,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:55:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 06:55:56,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:56,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1216797842, now seen corresponding path program 1 times [2025-03-08 06:55:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369599666] [2025-03-08 06:55:56,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:56,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:55:56,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:55:56,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:56,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:55:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369599666] [2025-03-08 06:55:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369599666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:55:56,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175753064] [2025-03-08 06:55:56,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:56,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:55:56,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:55:56,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:55:56,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:55:56,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:55:56,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:56,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:56,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:55:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:55:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:55:56,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:55:56,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175753064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:56,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:55:56,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:55:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458430420] [2025-03-08 06:55:56,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:56,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:55:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:56,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:55:56,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:56,939 INFO L87 Difference]: Start difference. First operand 3122 states and 5313 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:55:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:57,034 INFO L93 Difference]: Finished difference Result 4971 states and 7863 transitions. [2025-03-08 06:55:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:55:57,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2025-03-08 06:55:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:57,049 INFO L225 Difference]: With dead ends: 4971 [2025-03-08 06:55:57,050 INFO L226 Difference]: Without dead ends: 3981 [2025-03-08 06:55:57,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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-03-08 06:55:57,055 INFO L435 NwaCegarLoop]: 4218 mSDtfsCounter, 111 mSDsluCounter, 4102 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8320 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-03-08 06:55:57,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:55:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2025-03-08 06:55:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2025-03-08 06:55:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3606 states have (on average 1.6569606211869108) internal successors, (5975), 3632 states have internal predecessors, (5975), 221 states have call successors, (221), 137 states have call predecessors, (221), 152 states have return successors, (270), 215 states have call predecessors, (270), 219 states have call successors, (270) [2025-03-08 06:55:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 6466 transitions. [2025-03-08 06:55:57,289 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 6466 transitions. Word has length 90 [2025-03-08 06:55:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:57,291 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 6466 transitions. [2025-03-08 06:55:57,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:55:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 6466 transitions. [2025-03-08 06:55:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 06:55:57,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:57,299 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:55:57,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:55:57,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 06:55:57,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:57,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1183890374, now seen corresponding path program 1 times [2025-03-08 06:55:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479899447] [2025-03-08 06:55:57,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:57,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:55:57,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:55:57,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:57,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 06:55:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479899447] [2025-03-08 06:55:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479899447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:55:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516333475] [2025-03-08 06:55:57,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:57,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:57,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:55:57,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:55:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:55:57,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:55:57,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:55:57,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:57,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:57,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:55:57,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:55:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 06:55:57,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:55:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516333475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:57,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:55:57,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:55:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162529088] [2025-03-08 06:55:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:57,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:55:57,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:57,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:55:57,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:57,784 INFO L87 Difference]: Start difference. First operand 3981 states and 6466 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:55:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:57,919 INFO L93 Difference]: Finished difference Result 6017 states and 9267 transitions. [2025-03-08 06:55:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:55:57,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 131 [2025-03-08 06:55:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:57,947 INFO L225 Difference]: With dead ends: 6017 [2025-03-08 06:55:57,950 INFO L226 Difference]: Without dead ends: 4173 [2025-03-08 06:55:57,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 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-03-08 06:55:57,957 INFO L435 NwaCegarLoop]: 4108 mSDtfsCounter, 4084 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:57,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4132 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:55:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2025-03-08 06:55:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4173. [2025-03-08 06:55:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 3778 states have (on average 1.6201694017998942) internal successors, (6121), 3804 states have internal predecessors, (6121), 225 states have call successors, (225), 153 states have call predecessors, (225), 168 states have return successors, (274), 219 states have call predecessors, (274), 223 states have call successors, (274) [2025-03-08 06:55:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 6620 transitions. [2025-03-08 06:55:58,088 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 6620 transitions. Word has length 131 [2025-03-08 06:55:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:58,088 INFO L471 AbstractCegarLoop]: Abstraction has 4173 states and 6620 transitions. [2025-03-08 06:55:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:55:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 6620 transitions. [2025-03-08 06:55:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 06:55:58,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:58,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:55:58,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:55:58,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:58,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:58,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash 123624886, now seen corresponding path program 1 times [2025-03-08 06:55:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245335095] [2025-03-08 06:55:58,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:58,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:55:58,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:55:58,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:58,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 06:55:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:58,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245335095] [2025-03-08 06:55:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245335095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:55:58,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44304524] [2025-03-08 06:55:58,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:58,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:55:58,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:55:58,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:55:58,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:55:58,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:55:58,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:58,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:58,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:55:58,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:55:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 06:55:58,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:55:58,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44304524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:58,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:55:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:55:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979815244] [2025-03-08 06:55:58,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:58,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:55:58,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:58,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:55:58,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:58,540 INFO L87 Difference]: Start difference. First operand 4173 states and 6620 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:55:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:58,651 INFO L93 Difference]: Finished difference Result 5908 states and 8876 transitions. [2025-03-08 06:55:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:55:58,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 131 [2025-03-08 06:55:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:58,669 INFO L225 Difference]: With dead ends: 5908 [2025-03-08 06:55:58,670 INFO L226 Difference]: Without dead ends: 4293 [2025-03-08 06:55:58,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 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-03-08 06:55:58,677 INFO L435 NwaCegarLoop]: 4125 mSDtfsCounter, 4054 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4054 SdHoareTripleChecker+Valid, 4258 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:58,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4054 Valid, 4258 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:55:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2025-03-08 06:55:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 4161. [2025-03-08 06:55:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 3766 states have (on average 1.6125862984599044) internal successors, (6073), 3792 states have internal predecessors, (6073), 225 states have call successors, (225), 153 states have call predecessors, (225), 168 states have return successors, (274), 219 states have call predecessors, (274), 223 states have call successors, (274) [2025-03-08 06:55:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 6572 transitions. [2025-03-08 06:55:58,822 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 6572 transitions. Word has length 131 [2025-03-08 06:55:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:58,823 INFO L471 AbstractCegarLoop]: Abstraction has 4161 states and 6572 transitions. [2025-03-08 06:55:58,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:55:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 6572 transitions. [2025-03-08 06:55:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:55:58,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:58,827 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:55:58,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 06:55:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:59,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2045141427, now seen corresponding path program 1 times [2025-03-08 06:55:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538625044] [2025-03-08 06:55:59,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:59,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:55:59,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:55:59,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:59,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 06:55:59,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538625044] [2025-03-08 06:55:59,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538625044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:55:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962001267] [2025-03-08 06:55:59,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:59,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:55:59,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:55:59,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:55:59,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:55:59,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:55:59,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:59,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:59,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:55:59,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:55:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 06:55:59,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:55:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962001267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:55:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:55:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:55:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239145152] [2025-03-08 06:55:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:55:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:55:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:55:59,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:55:59,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:55:59,271 INFO L87 Difference]: Start difference. First operand 4161 states and 6572 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:55:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:59,454 INFO L93 Difference]: Finished difference Result 8061 states and 11638 transitions. [2025-03-08 06:55:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:55:59,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 132 [2025-03-08 06:55:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:59,479 INFO L225 Difference]: With dead ends: 8061 [2025-03-08 06:55:59,480 INFO L226 Difference]: Without dead ends: 6037 [2025-03-08 06:55:59,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 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-03-08 06:55:59,488 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 120 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8309 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-03-08 06:55:59,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:55:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2025-03-08 06:55:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 6033. [2025-03-08 06:55:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6033 states, 5272 states have (on average 1.5077769347496206) internal successors, (7949), 5322 states have internal predecessors, (7949), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-08 06:55:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 8978 transitions. [2025-03-08 06:55:59,715 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 8978 transitions. Word has length 132 [2025-03-08 06:55:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:55:59,716 INFO L471 AbstractCegarLoop]: Abstraction has 6033 states and 8978 transitions. [2025-03-08 06:55:59,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:55:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 8978 transitions. [2025-03-08 06:55:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:55:59,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:55:59,723 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:55:59,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 06:55:59,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 06:55:59,924 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:55:59,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:55:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash 231492628, now seen corresponding path program 1 times [2025-03-08 06:55:59,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:55:59,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734051903] [2025-03-08 06:55:59,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:55:59,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:55:59,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:55:59,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:55:59,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:55:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 06:55:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:55:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734051903] [2025-03-08 06:55:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734051903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:55:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459784087] [2025-03-08 06:55:59,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:55:59,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:55:59,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:55:59,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:55:59,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:56:00,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:00,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:00,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:00,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:00,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:56:00,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:56:00,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459784087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:56:00,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055393730] [2025-03-08 06:56:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:56:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:00,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:56:00,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:00,125 INFO L87 Difference]: Start difference. First operand 6033 states and 8978 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:56:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:00,262 INFO L93 Difference]: Finished difference Result 8051 states and 11706 transitions. [2025-03-08 06:56:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:56:00,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2025-03-08 06:56:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:00,282 INFO L225 Difference]: With dead ends: 8051 [2025-03-08 06:56:00,282 INFO L226 Difference]: Without dead ends: 6045 [2025-03-08 06:56:00,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 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-03-08 06:56:00,291 INFO L435 NwaCegarLoop]: 4180 mSDtfsCounter, 85 mSDsluCounter, 4092 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 8272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:00,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 8272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:56:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2025-03-08 06:56:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 6025. [2025-03-08 06:56:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 5264 states have (on average 1.4971504559270516) internal successors, (7881), 5314 states have internal predecessors, (7881), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-08 06:56:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8910 transitions. [2025-03-08 06:56:00,520 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8910 transitions. Word has length 133 [2025-03-08 06:56:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:00,521 INFO L471 AbstractCegarLoop]: Abstraction has 6025 states and 8910 transitions. [2025-03-08 06:56:00,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:56:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8910 transitions. [2025-03-08 06:56:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:56:00,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:00,526 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:56:00,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 06:56:00,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:00,727 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:00,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1177438217, now seen corresponding path program 1 times [2025-03-08 06:56:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447092081] [2025-03-08 06:56:00,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:00,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:56:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:56:00,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:00,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:56:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447092081] [2025-03-08 06:56:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447092081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166231748] [2025-03-08 06:56:00,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:00,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:00,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:00,782 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:00,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:56:00,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:56:00,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:56:00,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:00,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:00,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:56:00,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 06:56:00,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166231748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-08 06:56:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342597067] [2025-03-08 06:56:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:00,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:00,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:00,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:00,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:56:00,931 INFO L87 Difference]: Start difference. First operand 6025 states and 8910 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:56:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:01,233 INFO L93 Difference]: Finished difference Result 9905 states and 13917 transitions. [2025-03-08 06:56:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:01,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 134 [2025-03-08 06:56:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:01,251 INFO L225 Difference]: With dead ends: 9905 [2025-03-08 06:56:01,251 INFO L226 Difference]: Without dead ends: 6025 [2025-03-08 06:56:01,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:01,265 INFO L435 NwaCegarLoop]: 4055 mSDtfsCounter, 4104 mSDsluCounter, 8065 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 12120 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:01,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 12120 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:56:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2025-03-08 06:56:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 6025. [2025-03-08 06:56:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 5264 states have (on average 1.4789133738601823) internal successors, (7785), 5314 states have internal predecessors, (7785), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-08 06:56:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8814 transitions. [2025-03-08 06:56:01,564 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8814 transitions. Word has length 134 [2025-03-08 06:56:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:01,565 INFO L471 AbstractCegarLoop]: Abstraction has 6025 states and 8814 transitions. [2025-03-08 06:56:01,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:56:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8814 transitions. [2025-03-08 06:56:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:56:01,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:01,570 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:56:01,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 06:56:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:01,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -661917768, now seen corresponding path program 1 times [2025-03-08 06:56:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034081655] [2025-03-08 06:56:01,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:01,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:56:01,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:56:01,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:01,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:56:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034081655] [2025-03-08 06:56:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034081655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257306394] [2025-03-08 06:56:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:01,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:01,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 06:56:01,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:56:01,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:56:01,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:01,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:01,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:56:01,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 06:56:01,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:01,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257306394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:01,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-08 06:56:01,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570502250] [2025-03-08 06:56:01,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:01,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:01,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:01,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:56:01,969 INFO L87 Difference]: Start difference. First operand 6025 states and 8814 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:56:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:02,255 INFO L93 Difference]: Finished difference Result 9481 states and 13297 transitions. [2025-03-08 06:56:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:56:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 134 [2025-03-08 06:56:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:02,277 INFO L225 Difference]: With dead ends: 9481 [2025-03-08 06:56:02,277 INFO L226 Difference]: Without dead ends: 6157 [2025-03-08 06:56:02,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:56:02,287 INFO L435 NwaCegarLoop]: 4053 mSDtfsCounter, 4142 mSDsluCounter, 8060 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4151 SdHoareTripleChecker+Valid, 12113 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:02,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4151 Valid, 12113 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:56:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2025-03-08 06:56:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 5167. [2025-03-08 06:56:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5167 states, 4590 states have (on average 1.489760348583878) internal successors, (6838), 4620 states have internal predecessors, (6838), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2025-03-08 06:56:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 7608 transitions. [2025-03-08 06:56:02,443 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 7608 transitions. Word has length 134 [2025-03-08 06:56:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:02,444 INFO L471 AbstractCegarLoop]: Abstraction has 5167 states and 7608 transitions. [2025-03-08 06:56:02,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:56:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 7608 transitions. [2025-03-08 06:56:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:56:02,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:02,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:56:02,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 06:56:02,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:56:02,652 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:02,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1615119401, now seen corresponding path program 1 times [2025-03-08 06:56:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469096392] [2025-03-08 06:56:02,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:02,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:56:02,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:56:02,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:56:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469096392] [2025-03-08 06:56:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469096392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707278735] [2025-03-08 06:56:02,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:02,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:02,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 06:56:02,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:56:02,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:56:02,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:02,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 06:56:02,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:56:02,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:56:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 06:56:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707278735] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:02,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 06:56:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 06:56:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478020703] [2025-03-08 06:56:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:02,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:56:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:02,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:56:02,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:56:02,964 INFO L87 Difference]: Start difference. First operand 5167 states and 7608 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:56:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:03,398 INFO L93 Difference]: Finished difference Result 8984 states and 12128 transitions. [2025-03-08 06:56:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:03,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 134 [2025-03-08 06:56:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:03,421 INFO L225 Difference]: With dead ends: 8984 [2025-03-08 06:56:03,421 INFO L226 Difference]: Without dead ends: 7532 [2025-03-08 06:56:03,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:56:03,427 INFO L435 NwaCegarLoop]: 4199 mSDtfsCounter, 4178 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 8350 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:03,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 8350 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:56:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7532 states. [2025-03-08 06:56:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7532 to 6278. [2025-03-08 06:56:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6278 states, 5493 states have (on average 1.4296377207354816) internal successors, (7853), 5527 states have internal predecessors, (7853), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2025-03-08 06:56:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 8901 transitions. [2025-03-08 06:56:03,679 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 8901 transitions. Word has length 134 [2025-03-08 06:56:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 6278 states and 8901 transitions. [2025-03-08 06:56:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:56:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 8901 transitions. [2025-03-08 06:56:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 06:56:03,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:03,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:56:03,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 06:56:03,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 06:56:03,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:03,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1698461743, now seen corresponding path program 1 times [2025-03-08 06:56:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:03,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885811169] [2025-03-08 06:56:03,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:03,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 06:56:03,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 06:56:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:56:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885811169] [2025-03-08 06:56:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885811169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925270327] [2025-03-08 06:56:03,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:03,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:03,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 06:56:03,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 06:56:04,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 06:56:04,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:04,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:04,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:56:04,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 06:56:04,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925270327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:04,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:56:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472105360] [2025-03-08 06:56:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:04,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:56:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:04,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:56:04,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:04,032 INFO L87 Difference]: Start difference. First operand 6278 states and 8901 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 06:56:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:04,200 INFO L93 Difference]: Finished difference Result 8277 states and 11278 transitions. [2025-03-08 06:56:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:56:04,201 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 138 [2025-03-08 06:56:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:04,218 INFO L225 Difference]: With dead ends: 8277 [2025-03-08 06:56:04,218 INFO L226 Difference]: Without dead ends: 6282 [2025-03-08 06:56:04,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 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-03-08 06:56:04,225 INFO L435 NwaCegarLoop]: 4101 mSDtfsCounter, 0 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8191 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:04,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8191 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:56:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2025-03-08 06:56:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6282. [2025-03-08 06:56:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6282 states, 5497 states have (on average 1.4293250864107696) internal successors, (7857), 5531 states have internal predecessors, (7857), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2025-03-08 06:56:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 8905 transitions. [2025-03-08 06:56:04,444 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 8905 transitions. Word has length 138 [2025-03-08 06:56:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:04,444 INFO L471 AbstractCegarLoop]: Abstraction has 6282 states and 8905 transitions. [2025-03-08 06:56:04,444 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 06:56:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 8905 transitions. [2025-03-08 06:56:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 06:56:04,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:04,448 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-03-08 06:56:04,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 06:56:04,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 06:56:04,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:04,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 284302250, now seen corresponding path program 1 times [2025-03-08 06:56:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:04,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072456246] [2025-03-08 06:56:04,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:04,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:04,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:56:04,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:56:04,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:56:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:04,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072456246] [2025-03-08 06:56:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072456246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711384192] [2025-03-08 06:56:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:04,704 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:04,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 06:56:04,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:56:04,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:56:04,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:04,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:04,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 06:56:04,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 06:56:04,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:04,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711384192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:04,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:04,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 06:56:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201572048] [2025-03-08 06:56:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:04,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:04,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:04,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:04,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:56:04,803 INFO L87 Difference]: Start difference. First operand 6282 states and 8905 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 06:56:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:04,940 INFO L93 Difference]: Finished difference Result 8360 states and 11419 transitions. [2025-03-08 06:56:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:56:04,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 139 [2025-03-08 06:56:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:04,955 INFO L225 Difference]: With dead ends: 8360 [2025-03-08 06:56:04,955 INFO L226 Difference]: Without dead ends: 4904 [2025-03-08 06:56:04,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:56:04,963 INFO L435 NwaCegarLoop]: 4099 mSDtfsCounter, 0 mSDsluCounter, 12291 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16390 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:04,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16390 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:56:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2025-03-08 06:56:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4904. [2025-03-08 06:56:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4904 states, 4367 states have (on average 1.487291046485001) internal successors, (6495), 4393 states have internal predecessors, (6495), 307 states have call successors, (307), 205 states have call predecessors, (307), 228 states have return successors, (361), 309 states have call predecessors, (361), 305 states have call successors, (361) [2025-03-08 06:56:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 7163 transitions. [2025-03-08 06:56:05,097 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 7163 transitions. Word has length 139 [2025-03-08 06:56:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:05,097 INFO L471 AbstractCegarLoop]: Abstraction has 4904 states and 7163 transitions. [2025-03-08 06:56:05,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 06:56:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 7163 transitions. [2025-03-08 06:56:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 06:56:05,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:05,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:05,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 06:56:05,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 06:56:05,301 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:05,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash 458111660, now seen corresponding path program 1 times [2025-03-08 06:56:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586796098] [2025-03-08 06:56:05,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:05,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:56:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:56:05,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:05,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 06:56:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586796098] [2025-03-08 06:56:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586796098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152989125] [2025-03-08 06:56:05,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:05,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:05,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:05,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:05,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 06:56:05,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:56:05,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:56:05,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:05,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:05,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 06:56:05,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 06:56:05,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:05,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152989125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:05,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:05,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-08 06:56:05,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258379232] [2025-03-08 06:56:05,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:05,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:05,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:05,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:05,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:05,448 INFO L87 Difference]: Start difference. First operand 4904 states and 7163 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 06:56:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:05,587 INFO L93 Difference]: Finished difference Result 6572 states and 9111 transitions. [2025-03-08 06:56:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:56:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 139 [2025-03-08 06:56:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:05,595 INFO L225 Difference]: With dead ends: 6572 [2025-03-08 06:56:05,595 INFO L226 Difference]: Without dead ends: 2900 [2025-03-08 06:56:05,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:05,600 INFO L435 NwaCegarLoop]: 4097 mSDtfsCounter, 0 mSDsluCounter, 12285 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16382 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:05,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16382 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:56:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2025-03-08 06:56:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2900. [2025-03-08 06:56:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2753 states have (on average 1.6919723937522702) internal successors, (4658), 2761 states have internal predecessors, (4658), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2025-03-08 06:56:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4829 transitions. [2025-03-08 06:56:05,653 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4829 transitions. Word has length 139 [2025-03-08 06:56:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:05,653 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4829 transitions. [2025-03-08 06:56:05,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 06:56:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4829 transitions. [2025-03-08 06:56:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 06:56:05,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:05,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:05,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 06:56:05,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 06:56:05,859 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:05,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1762213900, now seen corresponding path program 1 times [2025-03-08 06:56:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:05,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331835570] [2025-03-08 06:56:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:05,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:56:05,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:56:05,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:05,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 06:56:05,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 06:56:05,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 06:56:05,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 06:56:05,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:05,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 06:56:05,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 06:56:05,931 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 06:56:05,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-08 06:56:05,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 06:56:05,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:56:05,936 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:06,030 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 06:56:06,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 06:56:06 BoogieIcfgContainer [2025-03-08 06:56:06,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 06:56:06,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 06:56:06,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 06:56:06,036 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 06:56:06,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:55:53" (3/4) ... [2025-03-08 06:56:06,038 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 06:56:06,132 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 102. [2025-03-08 06:56:06,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 06:56:06,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 06:56:06,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 06:56:06,203 INFO L158 Benchmark]: Toolchain (without parser) took 22045.07ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 90.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 289.9MB. Max. memory is 16.1GB. [2025-03-08 06:56:06,204 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 06:56:06,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2184.59ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 90.8MB in the beginning and 271.1MB in the end (delta: -180.3MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2025-03-08 06:56:06,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 396.10ms. Allocated memory is still 419.4MB. Free memory was 271.1MB in the beginning and 195.2MB in the end (delta: 75.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 06:56:06,204 INFO L158 Benchmark]: Boogie Preprocessor took 525.36ms. Allocated memory is still 419.4MB. Free memory was 195.2MB in the beginning and 254.0MB in the end (delta: -58.8MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. [2025-03-08 06:56:06,204 INFO L158 Benchmark]: IcfgBuilder took 6341.25ms. Allocated memory was 419.4MB in the beginning and 889.2MB in the end (delta: 469.8MB). Free memory was 254.0MB in the beginning and 482.9MB in the end (delta: -228.9MB). Peak memory consumption was 543.2MB. Max. memory is 16.1GB. [2025-03-08 06:56:06,204 INFO L158 Benchmark]: TraceAbstraction took 12423.56ms. Allocated memory was 889.2MB in the beginning and 1.5GB in the end (delta: 595.6MB). Free memory was 482.9MB in the beginning and 1.1GB in the end (delta: -659.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 06:56:06,204 INFO L158 Benchmark]: Witness Printer took 166.75ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 06:56:06,206 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 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2184.59ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 90.8MB in the beginning and 271.1MB in the end (delta: -180.3MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 396.10ms. Allocated memory is still 419.4MB. Free memory was 271.1MB in the beginning and 195.2MB in the end (delta: 75.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 525.36ms. Allocated memory is still 419.4MB. Free memory was 195.2MB in the beginning and 254.0MB in the end (delta: -58.8MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. * IcfgBuilder took 6341.25ms. Allocated memory was 419.4MB in the beginning and 889.2MB in the end (delta: 469.8MB). Free memory was 254.0MB in the beginning and 482.9MB in the end (delta: -228.9MB). Peak memory consumption was 543.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12423.56ms. Allocated memory was 889.2MB in the beginning and 1.5GB in the end (delta: 595.6MB). Free memory was 482.9MB in the beginning and 1.1GB in the end (delta: -659.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 166.75ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11133]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2296 locations, 4266 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45924 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45869 mSDsluCounter, 172754 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102564 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1375 IncrementalHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 70190 mSDtfsCounter, 1375 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1745 GetRequests, 1667 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6282occurred in iteration=15, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 2480 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3469 NumberOfCodeBlocks, 3469 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3434 ConstructedInterpolants, 0 QuantifiedInterpolants, 4403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4943 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 1510/1758 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 06:56:06,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE