./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.03.cil-1.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 5055f39b9198ec38ad0f2881791eb80b1e4ab6fc763077f931bae502928055b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:03:24,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:03:24,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:03:24,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:03:24,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:03:24,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:03:24,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:03:24,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:03:24,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:03:24,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:03:24,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:03:24,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:03:24,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:03:24,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:03:24,923 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:03:24,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:03:24,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:03:24,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:03:24,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:03:24,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:03:24,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:03:24,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:03:24,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:03:24,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:03:24,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:03:24,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:03:24,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:03:24,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:03:24,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:03:24,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:03:24,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:03:24,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:03:24,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:03:24,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:03:24,927 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 -> 5055f39b9198ec38ad0f2881791eb80b1e4ab6fc763077f931bae502928055b4 [2025-03-16 20:03:25,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:03:25,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:03:25,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:03:25,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:03:25,145 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:03:25,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c [2025-03-16 20:03:26,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d1afdb4/c8d35dbe80fd450bb7051a84925b32d3/FLAG27fdd4cc9 [2025-03-16 20:03:26,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:03:26,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c [2025-03-16 20:03:26,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d1afdb4/c8d35dbe80fd450bb7051a84925b32d3/FLAG27fdd4cc9 [2025-03-16 20:03:26,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d1afdb4/c8d35dbe80fd450bb7051a84925b32d3 [2025-03-16 20:03:26,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:03:26,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:03:26,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:03:26,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:03:26,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:03:26,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:03:26" (1/1) ... [2025-03-16 20:03:26,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:26, skipping insertion in model container [2025-03-16 20:03:26,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:03:26" (1/1) ... [2025-03-16 20:03:27,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:03:28,155 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.03.cil-1.c[382357,382370] [2025-03-16 20:03:28,181 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.03.cil-1.c[383339,383352] [2025-03-16 20:03:28,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:03:28,374 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:03:28,850 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.03.cil-1.c[382357,382370] [2025-03-16 20:03:28,853 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.03.cil-1.c[383339,383352] [2025-03-16 20:03:28,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:03:28,901 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:03:28,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28 WrapperNode [2025-03-16 20:03:28,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:03:28,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:03:28,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:03:28,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:03:28,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:28,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,223 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12678 [2025-03-16 20:03:29,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:03:29,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:03:29,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:03:29,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:03:29,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,368 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-16 20:03:29,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:03:29,590 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:03:29,590 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:03:29,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:03:29,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (1/1) ... [2025-03-16 20:03:29,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:03:29,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:29,616 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-16 20:03:29,621 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-16 20:03:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:03:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:03:29,634 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:03:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:03:29,634 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:03:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:03:29,634 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:03:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:03:29,634 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:03:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:03:29,634 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:03:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:03:29,635 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:03:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:03:29,635 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:03:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:03:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:03:29,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:03:29,724 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:03:29,726 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:03:36,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:03:36,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:03:36,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:03:36,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:03:36,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:03:36,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:03:36,032 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:03:36,228 INFO L? ?]: Removed 1699 outVars from TransFormulas that were not future-live. [2025-03-16 20:03:36,229 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:03:36,286 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:03:36,287 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:03:36,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:03:36 BoogieIcfgContainer [2025-03-16 20:03:36,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:03:36,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:03:36,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:03:36,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:03:36,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:03:26" (1/3) ... [2025-03-16 20:03:36,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d74d4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:03:36, skipping insertion in model container [2025-03-16 20:03:36,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:28" (2/3) ... [2025-03-16 20:03:36,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d74d4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:03:36, skipping insertion in model container [2025-03-16 20:03:36,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:03:36" (3/3) ... [2025-03-16 20:03:36,295 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.03.cil-1.c [2025-03-16 20:03:36,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:03:36,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.03.cil-1.c that has 8 procedures, 2277 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-16 20:03:36,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:03:36,393 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;@54af68a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:03:36,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:03:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 2277 states, 2249 states have (on average 1.879057358826145) internal successors, (4226), 2253 states have internal predecessors, (4226), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 20:03:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:36,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:36,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:36,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 46472052, now seen corresponding path program 1 times [2025-03-16 20:03:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079509402] [2025-03-16 20:03:36,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:36,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:36,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:36,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:36,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:36,770 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-16 20:03:36,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:36,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079509402] [2025-03-16 20:03:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079509402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:36,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:36,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134873712] [2025-03-16 20:03:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:36,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:36,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:36,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:36,803 INFO L87 Difference]: Start difference. First operand has 2277 states, 2249 states have (on average 1.879057358826145) internal successors, (4226), 2253 states have internal predecessors, (4226), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:37,235 INFO L93 Difference]: Finished difference Result 4699 states and 8763 transitions. [2025-03-16 20:03:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:03:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:37,261 INFO L225 Difference]: With dead ends: 4699 [2025-03-16 20:03:37,261 INFO L226 Difference]: Without dead ends: 2423 [2025-03-16 20:03:37,268 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-16 20:03:37,270 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4349 mSDsluCounter, 8371 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 12515 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:37,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4360 Valid, 12515 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:03:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2025-03-16 20:03:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2410. [2025-03-16 20:03:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2364 states have (on average 1.8358714043993232) internal successors, (4340), 2368 states have internal predecessors, (4340), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:03:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 4401 transitions. [2025-03-16 20:03:37,397 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 4401 transitions. Word has length 72 [2025-03-16 20:03:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 2410 states and 4401 transitions. [2025-03-16 20:03:37,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 4401 transitions. [2025-03-16 20:03:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:37,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:37,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:37,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:03:37,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 178403826, now seen corresponding path program 1 times [2025-03-16 20:03:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767712332] [2025-03-16 20:03:37,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:37,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:37,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:37,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:37,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:37,551 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-16 20:03:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767712332] [2025-03-16 20:03:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767712332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:37,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:37,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010705828] [2025-03-16 20:03:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:37,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:37,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:37,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:37,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:37,555 INFO L87 Difference]: Start difference. First operand 2410 states and 4401 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:37,863 INFO L93 Difference]: Finished difference Result 2714 states and 4875 transitions. [2025-03-16 20:03:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:37,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:37,876 INFO L225 Difference]: With dead ends: 2714 [2025-03-16 20:03:37,876 INFO L226 Difference]: Without dead ends: 2434 [2025-03-16 20:03:37,878 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-16 20:03:37,879 INFO L435 NwaCegarLoop]: 4126 mSDtfsCounter, 4241 mSDsluCounter, 8183 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4252 SdHoareTripleChecker+Valid, 12309 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:37,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4252 Valid, 12309 Invalid, 214 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-03-16 20:03:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2410. [2025-03-16 20:03:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2364 states have (on average 1.8350253807106598) internal successors, (4338), 2368 states have internal predecessors, (4338), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:03:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 4399 transitions. [2025-03-16 20:03:37,945 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 4399 transitions. Word has length 72 [2025-03-16 20:03:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:37,945 INFO L471 AbstractCegarLoop]: Abstraction has 2410 states and 4399 transitions. [2025-03-16 20:03:37,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 4399 transitions. [2025-03-16 20:03:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:37,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:37,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:37,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:03:37,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:37,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:37,948 INFO L85 PathProgramCache]: Analyzing trace with hash 458753715, now seen corresponding path program 1 times [2025-03-16 20:03:37,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:37,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470122411] [2025-03-16 20:03:37,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:37,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:37,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:37,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:37,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:37,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:38,080 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-16 20:03:38,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470122411] [2025-03-16 20:03:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470122411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:38,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:38,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:38,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357872519] [2025-03-16 20:03:38,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:38,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:38,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:38,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:38,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:38,082 INFO L87 Difference]: Start difference. First operand 2410 states and 4399 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:38,469 INFO L93 Difference]: Finished difference Result 2861 states and 5090 transitions. [2025-03-16 20:03:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:38,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:38,480 INFO L225 Difference]: With dead ends: 2861 [2025-03-16 20:03:38,481 INFO L226 Difference]: Without dead ends: 2581 [2025-03-16 20:03:38,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-16 20:03:38,485 INFO L435 NwaCegarLoop]: 4250 mSDtfsCounter, 4326 mSDsluCounter, 12721 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16971 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:38,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4337 Valid, 16971 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:03:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-03-16 20:03:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2540. [2025-03-16 20:03:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2475 states have (on average 1.821010101010101) internal successors, (4507), 2480 states have internal predecessors, (4507), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-16 20:03:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 4595 transitions. [2025-03-16 20:03:38,555 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 4595 transitions. Word has length 72 [2025-03-16 20:03:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:38,555 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 4595 transitions. [2025-03-16 20:03:38,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 4595 transitions. [2025-03-16 20:03:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:38,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:38,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:38,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:03:38,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:38,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1471865390, now seen corresponding path program 1 times [2025-03-16 20:03:38,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:38,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058703374] [2025-03-16 20:03:38,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:38,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:38,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:38,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:38,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:38,655 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-16 20:03:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:38,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058703374] [2025-03-16 20:03:38,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058703374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:38,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897613014] [2025-03-16 20:03:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:38,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:38,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:38,656 INFO L87 Difference]: Start difference. First operand 2540 states and 4595 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:39,026 INFO L93 Difference]: Finished difference Result 3264 states and 5703 transitions. [2025-03-16 20:03:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:39,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:39,037 INFO L225 Difference]: With dead ends: 3264 [2025-03-16 20:03:39,038 INFO L226 Difference]: Without dead ends: 2854 [2025-03-16 20:03:39,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-16 20:03:39,040 INFO L435 NwaCegarLoop]: 4246 mSDtfsCounter, 4321 mSDsluCounter, 12709 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4332 SdHoareTripleChecker+Valid, 16955 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:39,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4332 Valid, 16955 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:03:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2025-03-16 20:03:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2811. [2025-03-16 20:03:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2706 states have (on average 1.7960088691796008) internal successors, (4860), 2715 states have internal predecessors, (4860), 67 states have call successors, (67), 31 states have call predecessors, (67), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-03-16 20:03:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 5008 transitions. [2025-03-16 20:03:39,113 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 5008 transitions. Word has length 72 [2025-03-16 20:03:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:39,113 INFO L471 AbstractCegarLoop]: Abstraction has 2811 states and 5008 transitions. [2025-03-16 20:03:39,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 5008 transitions. [2025-03-16 20:03:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:39,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:39,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:39,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:03:39,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash -841406765, now seen corresponding path program 1 times [2025-03-16 20:03:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618168248] [2025-03-16 20:03:39,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:39,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:39,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:39,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:39,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:39,230 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-16 20:03:39,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:39,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618168248] [2025-03-16 20:03:39,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618168248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:39,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:39,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668400206] [2025-03-16 20:03:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:39,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:39,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:39,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:39,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:39,232 INFO L87 Difference]: Start difference. First operand 2811 states and 5008 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:39,748 INFO L93 Difference]: Finished difference Result 4197 states and 7147 transitions. [2025-03-16 20:03:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:39,773 INFO L225 Difference]: With dead ends: 4197 [2025-03-16 20:03:39,773 INFO L226 Difference]: Without dead ends: 3516 [2025-03-16 20:03:39,780 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-16 20:03:39,780 INFO L435 NwaCegarLoop]: 4241 mSDtfsCounter, 4408 mSDsluCounter, 12689 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4423 SdHoareTripleChecker+Valid, 16930 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:39,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4423 Valid, 16930 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:03:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2025-03-16 20:03:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3368. [2025-03-16 20:03:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3181 states have (on average 1.757937755422823) internal successors, (5592), 3204 states have internal predecessors, (5592), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:03:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5876 transitions. [2025-03-16 20:03:40,017 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5876 transitions. Word has length 72 [2025-03-16 20:03:40,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:40,017 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5876 transitions. [2025-03-16 20:03:40,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5876 transitions. [2025-03-16 20:03:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:40,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:40,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:40,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:03:40,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash -821069390, now seen corresponding path program 1 times [2025-03-16 20:03:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932787412] [2025-03-16 20:03:40,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:40,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:40,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:40,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:40,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:40,146 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-16 20:03:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932787412] [2025-03-16 20:03:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932787412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:40,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:40,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120980097] [2025-03-16 20:03:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:40,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:40,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:40,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:40,149 INFO L87 Difference]: Start difference. First operand 3368 states and 5876 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:40,359 INFO L93 Difference]: Finished difference Result 4722 states and 8008 transitions. [2025-03-16 20:03:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:40,373 INFO L225 Difference]: With dead ends: 4722 [2025-03-16 20:03:40,373 INFO L226 Difference]: Without dead ends: 3484 [2025-03-16 20:03:40,377 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-16 20:03:40,378 INFO L435 NwaCegarLoop]: 4117 mSDtfsCounter, 4233 mSDsluCounter, 8164 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 12281 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:40,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4244 Valid, 12281 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2025-03-16 20:03:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3368. [2025-03-16 20:03:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3181 states have (on average 1.7551084564602326) internal successors, (5583), 3204 states have internal predecessors, (5583), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:03:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5867 transitions. [2025-03-16 20:03:40,488 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5867 transitions. Word has length 72 [2025-03-16 20:03:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:40,488 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5867 transitions. [2025-03-16 20:03:40,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5867 transitions. [2025-03-16 20:03:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:40,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:40,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:40,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:03:40,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:40,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash -127676685, now seen corresponding path program 1 times [2025-03-16 20:03:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:40,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343564607] [2025-03-16 20:03:40,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:40,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:40,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:40,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:40,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:40,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:40,559 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-16 20:03:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343564607] [2025-03-16 20:03:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343564607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:40,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:40,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246169401] [2025-03-16 20:03:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:40,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:40,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:40,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:40,561 INFO L87 Difference]: Start difference. First operand 3368 states and 5867 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:40,797 INFO L93 Difference]: Finished difference Result 4664 states and 7874 transitions. [2025-03-16 20:03:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:40,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:40,810 INFO L225 Difference]: With dead ends: 4664 [2025-03-16 20:03:40,810 INFO L226 Difference]: Without dead ends: 3426 [2025-03-16 20:03:40,814 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-16 20:03:40,814 INFO L435 NwaCegarLoop]: 4112 mSDtfsCounter, 4229 mSDsluCounter, 8155 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4240 SdHoareTripleChecker+Valid, 12267 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:40,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4240 Valid, 12267 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2025-03-16 20:03:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3368. [2025-03-16 20:03:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3181 states have (on average 1.7522791574976422) internal successors, (5574), 3204 states have internal predecessors, (5574), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:03:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5858 transitions. [2025-03-16 20:03:40,904 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5858 transitions. Word has length 72 [2025-03-16 20:03:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:40,904 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5858 transitions. [2025-03-16 20:03:40,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5858 transitions. [2025-03-16 20:03:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:03:40,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:40,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:03:40,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:03:40,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:40,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2053209996, now seen corresponding path program 1 times [2025-03-16 20:03:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:40,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944629508] [2025-03-16 20:03:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:40,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:03:40,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:03:40,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:40,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:40,946 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-16 20:03:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944629508] [2025-03-16 20:03:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944629508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:03:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835735802] [2025-03-16 20:03:40,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:40,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:03:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:40,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:03:40,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:03:40,948 INFO L87 Difference]: Start difference. First operand 3368 states and 5858 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:41,117 INFO L93 Difference]: Finished difference Result 5756 states and 9562 transitions. [2025-03-16 20:03:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2025-03-16 20:03:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:41,139 INFO L225 Difference]: With dead ends: 5756 [2025-03-16 20:03:41,139 INFO L226 Difference]: Without dead ends: 4519 [2025-03-16 20:03:41,146 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-16 20:03:41,146 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4332 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4332 SdHoareTripleChecker+Valid, 8653 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:41,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4332 Valid, 8653 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2025-03-16 20:03:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4510. [2025-03-16 20:03:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4144 states have (on average 1.6821911196911197) internal successors, (6971), 4196 states have internal predecessors, (6971), 216 states have call successors, (216), 109 states have call predecessors, (216), 148 states have return successors, (335), 212 states have call predecessors, (335), 214 states have call successors, (335) [2025-03-16 20:03:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 7522 transitions. [2025-03-16 20:03:41,335 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 7522 transitions. Word has length 72 [2025-03-16 20:03:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:41,336 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 7522 transitions. [2025-03-16 20:03:41,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 7522 transitions. [2025-03-16 20:03:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:03:41,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:41,343 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, 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] [2025-03-16 20:03:41,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:03:41,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:41,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1793053810, now seen corresponding path program 1 times [2025-03-16 20:03:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:41,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16510888] [2025-03-16 20:03:41,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:41,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:41,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:41,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:41,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16510888] [2025-03-16 20:03:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16510888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437383750] [2025-03-16 20:03:41,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:41,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:41,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:41,408 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-16 20:03:41,410 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-16 20:03:41,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:41,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:41,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:41,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:41,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:41,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 20:03:41,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437383750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:41,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:03:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151424826] [2025-03-16 20:03:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:41,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:41,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:41,565 INFO L87 Difference]: Start difference. First operand 4510 states and 7522 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-16 20:03:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:41,722 INFO L93 Difference]: Finished difference Result 9177 states and 14566 transitions. [2025-03-16 20:03:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:41,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 116 [2025-03-16 20:03:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:41,747 INFO L225 Difference]: With dead ends: 9177 [2025-03-16 20:03:41,747 INFO L226 Difference]: Without dead ends: 6798 [2025-03-16 20:03:41,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-16 20:03:41,756 INFO L435 NwaCegarLoop]: 4178 mSDtfsCounter, 4138 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4376 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-16 20:03:41,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4376 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6798 states. [2025-03-16 20:03:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6798 to 6776. [2025-03-16 20:03:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6776 states, 6070 states have (on average 1.6191103789126853) internal successors, (9828), 6171 states have internal predecessors, (9828), 408 states have call successors, (408), 217 states have call predecessors, (408), 296 states have return successors, (641), 395 states have call predecessors, (641), 406 states have call successors, (641) [2025-03-16 20:03:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 10877 transitions. [2025-03-16 20:03:42,120 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 10877 transitions. Word has length 116 [2025-03-16 20:03:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 6776 states and 10877 transitions. [2025-03-16 20:03:42,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-16 20:03:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 10877 transitions. [2025-03-16 20:03:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:03:42,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:42,132 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, 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] [2025-03-16 20:03:42,141 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-16 20:03:42,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:42,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:42,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1146041800, now seen corresponding path program 1 times [2025-03-16 20:03:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:42,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289386833] [2025-03-16 20:03:42,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:42,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:42,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:42,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:42,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289386833] [2025-03-16 20:03:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289386833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103721311] [2025-03-16 20:03:42,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:42,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:42,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:42,397 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-16 20:03:42,398 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-16 20:03:42,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:42,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:42,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:42,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:42,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:42,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 20:03:42,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:42,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103721311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:42,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:42,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:03:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989607132] [2025-03-16 20:03:42,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:42,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:42,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:42,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:42,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:42,557 INFO L87 Difference]: Start difference. First operand 6776 states and 10877 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-16 20:03:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:42,930 INFO L93 Difference]: Finished difference Result 15933 states and 24651 transitions. [2025-03-16 20:03:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 116 [2025-03-16 20:03:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:42,975 INFO L225 Difference]: With dead ends: 15933 [2025-03-16 20:03:42,976 INFO L226 Difference]: Without dead ends: 11288 [2025-03-16 20:03:42,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-16 20:03:42,992 INFO L435 NwaCegarLoop]: 4178 mSDtfsCounter, 4133 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4133 SdHoareTripleChecker+Valid, 4376 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-16 20:03:42,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4133 Valid, 4376 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11288 states. [2025-03-16 20:03:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11288 to 11248. [2025-03-16 20:03:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11248 states, 9864 states have (on average 1.5642741281427412) internal successors, (15430), 10063 states have internal predecessors, (15430), 790 states have call successors, (790), 433 states have call predecessors, (790), 592 states have return successors, (1251), 759 states have call predecessors, (1251), 788 states have call successors, (1251) [2025-03-16 20:03:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11248 states to 11248 states and 17471 transitions. [2025-03-16 20:03:43,624 INFO L78 Accepts]: Start accepts. Automaton has 11248 states and 17471 transitions. Word has length 116 [2025-03-16 20:03:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 11248 states and 17471 transitions. [2025-03-16 20:03:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-16 20:03:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 11248 states and 17471 transitions. [2025-03-16 20:03:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:03:43,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:43,651 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, 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] [2025-03-16 20:03:43,665 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-16 20:03:43,852 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,SelfDestructingSolverStorable9 [2025-03-16 20:03:43,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:43,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash 144518990, now seen corresponding path program 1 times [2025-03-16 20:03:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781670189] [2025-03-16 20:03:43,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:43,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:43,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:43,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:43,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:43,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781670189] [2025-03-16 20:03:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781670189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710348642] [2025-03-16 20:03:43,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:43,935 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-16 20:03:43,936 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-16 20:03:43,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:44,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:44,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:44,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:44,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:44,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 20:03:44,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710348642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:44,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:03:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081858025] [2025-03-16 20:03:44,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:44,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:44,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:44,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:44,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:44,087 INFO L87 Difference]: Start difference. First operand 11248 states and 17471 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-16 20:03:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:44,725 INFO L93 Difference]: Finished difference Result 29121 states and 44231 transitions. [2025-03-16 20:03:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 116 [2025-03-16 20:03:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:44,788 INFO L225 Difference]: With dead ends: 29121 [2025-03-16 20:03:44,789 INFO L226 Difference]: Without dead ends: 20004 [2025-03-16 20:03:44,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-16 20:03:44,809 INFO L435 NwaCegarLoop]: 4178 mSDtfsCounter, 4143 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 4376 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-16 20:03:44,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 4376 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20004 states. [2025-03-16 20:03:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20004 to 19928. [2025-03-16 20:03:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19928 states, 17240 states have (on average 1.5263341067285383) internal successors, (26314), 17635 states have internal predecessors, (26314), 1502 states have call successors, (1502), 865 states have call predecessors, (1502), 1184 states have return successors, (2419), 1435 states have call predecessors, (2419), 1500 states have call successors, (2419) [2025-03-16 20:03:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19928 states to 19928 states and 30235 transitions. [2025-03-16 20:03:45,984 INFO L78 Accepts]: Start accepts. Automaton has 19928 states and 30235 transitions. Word has length 116 [2025-03-16 20:03:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:45,985 INFO L471 AbstractCegarLoop]: Abstraction has 19928 states and 30235 transitions. [2025-03-16 20:03:45,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-16 20:03:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 19928 states and 30235 transitions. [2025-03-16 20:03:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:03:46,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:46,004 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, 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] [2025-03-16 20:03:46,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:03:46,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:46,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:46,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -230852268, now seen corresponding path program 1 times [2025-03-16 20:03:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:46,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823827340] [2025-03-16 20:03:46,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:46,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:46,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:46,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:46,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:46,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823827340] [2025-03-16 20:03:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823827340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213155947] [2025-03-16 20:03:46,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:46,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:46,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:46,289 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-16 20:03:46,291 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-16 20:03:46,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:03:46,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:03:46,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:46,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:46,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:03:46,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213155947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:46,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566284308] [2025-03-16 20:03:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:46,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:46,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:46,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:46,411 INFO L87 Difference]: Start difference. First operand 19928 states and 30235 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:03:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:47,936 INFO L93 Difference]: Finished difference Result 54149 states and 81555 transitions. [2025-03-16 20:03:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 116 [2025-03-16 20:03:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:48,068 INFO L225 Difference]: With dead ends: 54149 [2025-03-16 20:03:48,068 INFO L226 Difference]: Without dead ends: 36353 [2025-03-16 20:03:48,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-16 20:03:48,104 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 184 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 8543 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-16 20:03:48,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 8543 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36353 states. [2025-03-16 20:03:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36353 to 36353. [2025-03-16 20:03:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36353 states, 31178 states have (on average 1.4953813586503304) internal successors, (46623), 31894 states have internal predecessors, (46623), 2831 states have call successors, (2831), 1703 states have call predecessors, (2831), 2342 states have return successors, (5130), 2771 states have call predecessors, (5130), 2829 states have call successors, (5130) [2025-03-16 20:03:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36353 states to 36353 states and 54584 transitions. [2025-03-16 20:03:49,517 INFO L78 Accepts]: Start accepts. Automaton has 36353 states and 54584 transitions. Word has length 116 [2025-03-16 20:03:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:49,518 INFO L471 AbstractCegarLoop]: Abstraction has 36353 states and 54584 transitions. [2025-03-16 20:03:49,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:03:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 36353 states and 54584 transitions. [2025-03-16 20:03:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:03:49,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:49,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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, 1] [2025-03-16 20:03:49,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:03:49,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:49,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:49,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2045656101, now seen corresponding path program 1 times [2025-03-16 20:03:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:49,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019926970] [2025-03-16 20:03:49,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:49,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:03:49,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:03:49,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:49,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-16 20:03:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019926970] [2025-03-16 20:03:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019926970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473471455] [2025-03-16 20:03:49,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:49,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:49,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:49,874 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-16 20:03:49,876 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-16 20:03:49,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:03:49,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:03:49,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:49,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:49,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:03:50,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:50,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473471455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:50,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963258272] [2025-03-16 20:03:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:50,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:50,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:50,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:50,076 INFO L87 Difference]: Start difference. First operand 36353 states and 54584 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:51,609 INFO L93 Difference]: Finished difference Result 59347 states and 89189 transitions. [2025-03-16 20:03:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 167 [2025-03-16 20:03:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:51,752 INFO L225 Difference]: With dead ends: 59347 [2025-03-16 20:03:51,752 INFO L226 Difference]: Without dead ends: 32021 [2025-03-16 20:03:51,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 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-16 20:03:51,833 INFO L435 NwaCegarLoop]: 4175 mSDtfsCounter, 4112 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 4215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32021 states. [2025-03-16 20:03:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32021 to 24509. [2025-03-16 20:03:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24509 states, 21270 states have (on average 1.4617301363422661) internal successors, (31091), 21510 states have internal predecessors, (31091), 1851 states have call successors, (1851), 1195 states have call predecessors, (1851), 1386 states have return successors, (2610), 1811 states have call predecessors, (2610), 1849 states have call successors, (2610) [2025-03-16 20:03:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24509 states to 24509 states and 35552 transitions. [2025-03-16 20:03:53,239 INFO L78 Accepts]: Start accepts. Automaton has 24509 states and 35552 transitions. Word has length 167 [2025-03-16 20:03:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 24509 states and 35552 transitions. [2025-03-16 20:03:53,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24509 states and 35552 transitions. [2025-03-16 20:03:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:03:53,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:53,272 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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, 1] [2025-03-16 20:03:53,280 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-16 20:03:53,476 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,SelfDestructingSolverStorable12 [2025-03-16 20:03:53,476 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:53,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 259824998, now seen corresponding path program 1 times [2025-03-16 20:03:53,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:53,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033246123] [2025-03-16 20:03:53,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:53,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:03:53,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:03:53,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:53,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:03:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033246123] [2025-03-16 20:03:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033246123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894883071] [2025-03-16 20:03:53,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:53,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:53,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:53,552 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-16 20:03:53,554 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-16 20:03:53,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:03:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:03:53,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:53,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:53,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:53,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:03:53,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894883071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:53,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182324523] [2025-03-16 20:03:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:53,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:53,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:53,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:53,735 INFO L87 Difference]: Start difference. First operand 24509 states and 35552 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:54,601 INFO L93 Difference]: Finished difference Result 49229 states and 71251 transitions. [2025-03-16 20:03:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:54,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 167 [2025-03-16 20:03:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:54,700 INFO L225 Difference]: With dead ends: 49229 [2025-03-16 20:03:54,700 INFO L226 Difference]: Without dead ends: 26859 [2025-03-16 20:03:54,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 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-16 20:03:54,741 INFO L435 NwaCegarLoop]: 4173 mSDtfsCounter, 4128 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4128 SdHoareTripleChecker+Valid, 4212 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:54,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4128 Valid, 4212 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26859 states. [2025-03-16 20:03:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26859 to 26859. [2025-03-16 20:03:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26859 states, 23400 states have (on average 1.4241452991452992) internal successors, (33325), 23640 states have internal predecessors, (33325), 1917 states have call successors, (1917), 1349 states have call predecessors, (1917), 1540 states have return successors, (2698), 1877 states have call predecessors, (2698), 1915 states have call successors, (2698) [2025-03-16 20:03:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26859 states to 26859 states and 37940 transitions. [2025-03-16 20:03:55,659 INFO L78 Accepts]: Start accepts. Automaton has 26859 states and 37940 transitions. Word has length 167 [2025-03-16 20:03:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 26859 states and 37940 transitions. [2025-03-16 20:03:55,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26859 states and 37940 transitions. [2025-03-16 20:03:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:03:55,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:55,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2025-03-16 20:03:55,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:03:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:55,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -875111669, now seen corresponding path program 1 times [2025-03-16 20:03:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310413326] [2025-03-16 20:03:55,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:55,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:03:55,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:03:55,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:55,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:03:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310413326] [2025-03-16 20:03:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310413326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701116918] [2025-03-16 20:03:56,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:56,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:56,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:56,040 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-16 20:03:56,041 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-16 20:03:56,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:03:56,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:03:56,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:56,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:56,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 20:03:56,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 20:03:56,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701116918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053672765] [2025-03-16 20:03:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:56,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:56,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:56,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:56,196 INFO L87 Difference]: Start difference. First operand 26859 states and 37940 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-16 20:03:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:56,975 INFO L93 Difference]: Finished difference Result 47804 states and 66488 transitions. [2025-03-16 20:03:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:56,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 167 [2025-03-16 20:03:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:57,084 INFO L225 Difference]: With dead ends: 47804 [2025-03-16 20:03:57,084 INFO L226 Difference]: Without dead ends: 28967 [2025-03-16 20:03:57,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 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-16 20:03:57,129 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4106 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4435 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-16 20:03:57,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4435 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28967 states. [2025-03-16 20:03:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28967 to 28835. [2025-03-16 20:03:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28835 states, 25200 states have (on average 1.3989285714285715) internal successors, (35253), 25440 states have internal predecessors, (35253), 1961 states have call successors, (1961), 1481 states have call predecessors, (1961), 1672 states have return successors, (2874), 1921 states have call predecessors, (2874), 1959 states have call successors, (2874) [2025-03-16 20:03:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28835 states to 28835 states and 40088 transitions. [2025-03-16 20:03:58,955 INFO L78 Accepts]: Start accepts. Automaton has 28835 states and 40088 transitions. Word has length 167 [2025-03-16 20:03:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:58,956 INFO L471 AbstractCegarLoop]: Abstraction has 28835 states and 40088 transitions. [2025-03-16 20:03:58,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-16 20:03:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28835 states and 40088 transitions. [2025-03-16 20:03:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 20:03:58,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:58,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1] [2025-03-16 20:03:58,991 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-16 20:03:59,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:59,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:59,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash 924180085, now seen corresponding path program 1 times [2025-03-16 20:03:59,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:59,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728741918] [2025-03-16 20:03:59,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:59,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:03:59,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:03:59,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:59,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:03:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728741918] [2025-03-16 20:03:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728741918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845434001] [2025-03-16 20:03:59,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:59,243 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-16 20:03:59,244 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-16 20:03:59,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:03:59,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:03:59,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:59,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:59,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:59,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:03:59,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845434001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409550927] [2025-03-16 20:03:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:59,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:59,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:59,373 INFO L87 Difference]: Start difference. First operand 28835 states and 40088 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:01,228 INFO L93 Difference]: Finished difference Result 79043 states and 109418 transitions. [2025-03-16 20:04:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2025-03-16 20:04:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:01,403 INFO L225 Difference]: With dead ends: 79043 [2025-03-16 20:04:01,403 INFO L226 Difference]: Without dead ends: 52347 [2025-03-16 20:04:01,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 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-16 20:04:01,454 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 178 mSDsluCounter, 4168 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 8534 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-16 20:04:01,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 8534 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52347 states. [2025-03-16 20:04:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52347 to 52343. [2025-03-16 20:04:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52343 states, 45398 states have (on average 1.3740473148596855) internal successors, (62379), 45876 states have internal predecessors, (62379), 3759 states have call successors, (3759), 2801 states have call predecessors, (3759), 3184 states have return successors, (6658), 3681 states have call predecessors, (6658), 3757 states have call successors, (6658) [2025-03-16 20:04:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52343 states to 52343 states and 72796 transitions. [2025-03-16 20:04:03,940 INFO L78 Accepts]: Start accepts. Automaton has 52343 states and 72796 transitions. Word has length 168 [2025-03-16 20:04:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:03,941 INFO L471 AbstractCegarLoop]: Abstraction has 52343 states and 72796 transitions. [2025-03-16 20:04:03,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 52343 states and 72796 transitions. [2025-03-16 20:04:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 20:04:04,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:04,029 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1] [2025-03-16 20:04:04,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 20:04:04,229 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,SelfDestructingSolverStorable15 [2025-03-16 20:04:04,230 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:04,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1147957032, now seen corresponding path program 1 times [2025-03-16 20:04:04,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:04,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046638045] [2025-03-16 20:04:04,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:04,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:04,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 20:04:04,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 20:04:04,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:04,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 20:04:04,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:04,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046638045] [2025-03-16 20:04:04,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046638045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:04:04,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676963336] [2025-03-16 20:04:04,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:04,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:04:04,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:04,294 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-16 20:04:04,296 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-16 20:04:04,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 20:04:04,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 20:04:04,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:04,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:04,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:04:04,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:04:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 20:04:04,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:04:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676963336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:04,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:04:04,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:04:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575734958] [2025-03-16 20:04:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:04,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:04,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:04,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:04,457 INFO L87 Difference]: Start difference. First operand 52343 states and 72796 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:06,940 INFO L93 Difference]: Finished difference Result 105963 states and 148667 transitions. [2025-03-16 20:04:06,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:06,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 169 [2025-03-16 20:04:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:07,158 INFO L225 Difference]: With dead ends: 105963 [2025-03-16 20:04:07,158 INFO L226 Difference]: Without dead ends: 55767 [2025-03-16 20:04:07,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 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-16 20:04:07,262 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4136 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 4219 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-16 20:04:07,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 4219 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55767 states. [2025-03-16 20:04:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55767 to 52343. [2025-03-16 20:04:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52343 states, 45398 states have (on average 1.3483193092206704) internal successors, (61211), 45876 states have internal predecessors, (61211), 3759 states have call successors, (3759), 2801 states have call predecessors, (3759), 3184 states have return successors, (6262), 3681 states have call predecessors, (6262), 3757 states have call successors, (6262) [2025-03-16 20:04:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52343 states to 52343 states and 71232 transitions. [2025-03-16 20:04:09,580 INFO L78 Accepts]: Start accepts. Automaton has 52343 states and 71232 transitions. Word has length 169 [2025-03-16 20:04:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:09,581 INFO L471 AbstractCegarLoop]: Abstraction has 52343 states and 71232 transitions. [2025-03-16 20:04:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52343 states and 71232 transitions. [2025-03-16 20:04:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 20:04:09,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:09,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-03-16 20:04:09,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 20:04:09,845 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,SelfDestructingSolverStorable16 [2025-03-16 20:04:09,845 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:09,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash 184964474, now seen corresponding path program 1 times [2025-03-16 20:04:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:09,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539886383] [2025-03-16 20:04:09,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:09,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 20:04:09,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 20:04:09,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:09,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 20:04:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539886383] [2025-03-16 20:04:09,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539886383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:04:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657072414] [2025-03-16 20:04:09,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:04:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:09,914 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-16 20:04:09,916 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-16 20:04:09,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 20:04:10,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 20:04:10,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:10,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:10,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:04:10,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:04:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 20:04:10,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:04:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657072414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:10,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:04:10,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:04:10,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703602091] [2025-03-16 20:04:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:10,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:10,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:10,067 INFO L87 Difference]: Start difference. First operand 52343 states and 71232 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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)