./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.05.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 806c9058928482f755246f30ce94bbbe3c870162d7ccdd45454f74a5441d158a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:52:52,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:52:52,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:52:52,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:52:52,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:52:53,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:52:53,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:52:53,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:52:53,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:52:53,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:52:53,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:52:53,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:52:53,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:52:53,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:52:53,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:52:53,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:52:53,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:52:53,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:52:53,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:52:53,016 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 -> 806c9058928482f755246f30ce94bbbe3c870162d7ccdd45454f74a5441d158a [2025-03-08 06:52:53,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:52:53,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:52:53,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:52:53,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:52:53,266 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:52:53,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.05.cil-1.c [2025-03-08 06:52:55,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d4d3a8d/2ff099b84ce84c44833c6f726d6be7e6/FLAG876aed876 [2025-03-08 06:52:55,761 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:52:55,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.05.cil-1.c [2025-03-08 06:52:55,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d4d3a8d/2ff099b84ce84c44833c6f726d6be7e6/FLAG876aed876 [2025-03-08 06:52:56,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d4d3a8d/2ff099b84ce84c44833c6f726d6be7e6 [2025-03-08 06:52:56,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:52:56,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:52:56,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:52:56,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:52:56,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:52:56,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:52:56" (1/1) ... [2025-03-08 06:52:56,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b0be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:56, skipping insertion in model container [2025-03-08 06:52:56,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:52:56" (1/1) ... [2025-03-08 06:52:56,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:52:57,489 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_label44+token_ring.05.cil-1.c[377340,377353] [2025-03-08 06:52:57,520 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_label44+token_ring.05.cil-1.c[383339,383352] [2025-03-08 06:52:57,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:52:57,712 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:52:58,217 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_label44+token_ring.05.cil-1.c[377340,377353] [2025-03-08 06:52:58,223 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_label44+token_ring.05.cil-1.c[383339,383352] [2025-03-08 06:52:58,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:52:58,285 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:52:58,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58 WrapperNode [2025-03-08 06:52:58,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:52:58,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:52:58,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:52:58,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:52:58,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,628 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-03-08 06:52:58,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:52:58,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:52:58,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:52:58,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:52:58,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,736 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:52:58,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:52:58,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:52:58,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:52:58,950 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:52:58,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (1/1) ... [2025-03-08 06:52:58,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:52:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:52:58,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:52:58,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:52:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:52:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:52:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:52:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:52:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:52:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:52:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:52:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:52:59,082 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:52:59,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:53:05,167 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:53:05,167 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:53:05,168 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:53:05,168 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:53:05,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:53:05,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:53:05,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:53:05,352 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-03-08 06:53:05,354 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:53:05,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:53:05,417 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:53:05,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:05 BoogieIcfgContainer [2025-03-08 06:53:05,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:53:05,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:53:05,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:53:05,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:53:05,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:52:56" (1/3) ... [2025-03-08 06:53:05,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695ee8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:05, skipping insertion in model container [2025-03-08 06:53:05,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:58" (2/3) ... [2025-03-08 06:53:05,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695ee8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:05, skipping insertion in model container [2025-03-08 06:53:05,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:05" (3/3) ... [2025-03-08 06:53:05,425 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.05.cil-1.c [2025-03-08 06:53:05,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:53:05,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.05.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-08 06:53:05,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:53:05,550 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;@192d843d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:53:05,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:53:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 06:53:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:05,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:05,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:05,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:05,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash 393164962, now seen corresponding path program 1 times [2025-03-08 06:53:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18745952] [2025-03-08 06:53:05,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:05,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:05,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:05,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:05,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18745952] [2025-03-08 06:53:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18745952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429565398] [2025-03-08 06:53:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:05,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:05,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:05,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:05,994 INFO L87 Difference]: Start difference. First operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:06,529 INFO L93 Difference]: Finished difference Result 4973 states and 9123 transitions. [2025-03-08 06:53:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:53:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:06,548 INFO L225 Difference]: With dead ends: 4973 [2025-03-08 06:53:06,549 INFO L226 Difference]: Without dead ends: 2528 [2025-03-08 06:53:06,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:06,566 INFO L435 NwaCegarLoop]: 4264 mSDtfsCounter, 4579 mSDsluCounter, 8647 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 12911 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:06,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 12911 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:53:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-03-08 06:53:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2513. [2025-03-08 06:53:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2465 states have (on average 1.8227180527383366) internal successors, (4493), 2468 states have internal predecessors, (4493), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 06:53:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4560 transitions. [2025-03-08 06:53:06,702 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4560 transitions. Word has length 99 [2025-03-08 06:53:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:06,703 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4560 transitions. [2025-03-08 06:53:06,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4560 transitions. [2025-03-08 06:53:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:06,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:06,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:06,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:53:06,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:06,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash -398788892, now seen corresponding path program 1 times [2025-03-08 06:53:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:06,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495640573] [2025-03-08 06:53:06,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:06,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:06,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:06,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:06,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495640573] [2025-03-08 06:53:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495640573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:06,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:06,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311731242] [2025-03-08 06:53:06,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:06,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:06,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:06,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:06,849 INFO L87 Difference]: Start difference. First operand 2513 states and 4560 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:07,147 INFO L93 Difference]: Finished difference Result 2928 states and 5211 transitions. [2025-03-08 06:53:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:07,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:07,160 INFO L225 Difference]: With dead ends: 2928 [2025-03-08 06:53:07,160 INFO L226 Difference]: Without dead ends: 2549 [2025-03-08 06:53:07,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:07,164 INFO L435 NwaCegarLoop]: 4183 mSDtfsCounter, 4356 mSDsluCounter, 8281 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12464 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:07,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12464 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-03-08 06:53:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2513. [2025-03-08 06:53:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2465 states have (on average 1.8219066937119675) internal successors, (4491), 2468 states have internal predecessors, (4491), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 06:53:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4558 transitions. [2025-03-08 06:53:07,235 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4558 transitions. Word has length 99 [2025-03-08 06:53:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:07,235 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4558 transitions. [2025-03-08 06:53:07,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4558 transitions. [2025-03-08 06:53:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:07,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:07,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:07,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:53:07,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:07,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash 384590083, now seen corresponding path program 1 times [2025-03-08 06:53:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:07,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768950487] [2025-03-08 06:53:07,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:07,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:07,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:07,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:07,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:07,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768950487] [2025-03-08 06:53:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768950487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461806915] [2025-03-08 06:53:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:07,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:07,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:07,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:07,398 INFO L87 Difference]: Start difference. First operand 2513 states and 4558 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:07,904 INFO L93 Difference]: Finished difference Result 3129 states and 5513 transitions. [2025-03-08 06:53:07,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:07,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:07,914 INFO L225 Difference]: With dead ends: 3129 [2025-03-08 06:53:07,915 INFO L226 Difference]: Without dead ends: 2750 [2025-03-08 06:53:07,917 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-08 06:53:07,918 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4500 mSDsluCounter, 13021 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4513 SdHoareTripleChecker+Valid, 17364 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:07,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4513 Valid, 17364 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2025-03-08 06:53:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2691. [2025-03-08 06:53:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2622 states have (on average 1.8035850495804728) internal successors, (4729), 2626 states have internal predecessors, (4729), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-08 06:53:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 4827 transitions. [2025-03-08 06:53:07,979 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 4827 transitions. Word has length 99 [2025-03-08 06:53:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:07,980 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 4827 transitions. [2025-03-08 06:53:07,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 4827 transitions. [2025-03-08 06:53:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:07,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:07,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:07,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:53:07,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash -144328956, now seen corresponding path program 1 times [2025-03-08 06:53:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326841783] [2025-03-08 06:53:07,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:07,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:07,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:07,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326841783] [2025-03-08 06:53:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326841783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949756316] [2025-03-08 06:53:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:08,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:08,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:08,119 INFO L87 Difference]: Start difference. First operand 2691 states and 4827 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:08,577 INFO L93 Difference]: Finished difference Result 3688 states and 6369 transitions. [2025-03-08 06:53:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:08,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:08,599 INFO L225 Difference]: With dead ends: 3688 [2025-03-08 06:53:08,599 INFO L226 Difference]: Without dead ends: 3131 [2025-03-08 06:53:08,603 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-08 06:53:08,605 INFO L435 NwaCegarLoop]: 4339 mSDtfsCounter, 4495 mSDsluCounter, 13009 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 17348 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:08,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 17348 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:53:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2025-03-08 06:53:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3066. [2025-03-08 06:53:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2953 states have (on average 1.7731120894006096) internal successors, (5236), 2961 states have internal predecessors, (5236), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-08 06:53:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 5402 transitions. [2025-03-08 06:53:08,696 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 5402 transitions. Word has length 99 [2025-03-08 06:53:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:08,696 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 5402 transitions. [2025-03-08 06:53:08,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 5402 transitions. [2025-03-08 06:53:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:08,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:08,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:08,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:53:08,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash -715580189, now seen corresponding path program 1 times [2025-03-08 06:53:08,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:08,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749550929] [2025-03-08 06:53:08,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:08,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:08,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:08,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:08,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749550929] [2025-03-08 06:53:08,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749550929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707093155] [2025-03-08 06:53:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:08,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:08,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:08,795 INFO L87 Difference]: Start difference. First operand 3066 states and 5402 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:09,343 INFO L93 Difference]: Finished difference Result 4877 states and 8226 transitions. [2025-03-08 06:53:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:09,361 INFO L225 Difference]: With dead ends: 4877 [2025-03-08 06:53:09,361 INFO L226 Difference]: Without dead ends: 3945 [2025-03-08 06:53:09,366 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-08 06:53:09,367 INFO L435 NwaCegarLoop]: 4336 mSDtfsCounter, 4490 mSDsluCounter, 13000 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4503 SdHoareTripleChecker+Valid, 17336 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:09,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4503 Valid, 17336 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:53:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-08 06:53:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3867. [2025-03-08 06:53:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3867 states, 3660 states have (on average 1.7300546448087433) internal successors, (6332), 3682 states have internal predecessors, (6332), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-08 06:53:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 6658 transitions. [2025-03-08 06:53:09,497 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 6658 transitions. Word has length 99 [2025-03-08 06:53:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 3867 states and 6658 transitions. [2025-03-08 06:53:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 6658 transitions. [2025-03-08 06:53:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:09,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:09,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:53:09,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -595460316, now seen corresponding path program 1 times [2025-03-08 06:53:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292833465] [2025-03-08 06:53:09,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:09,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:09,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:09,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:09,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:09,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:09,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292833465] [2025-03-08 06:53:09,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292833465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:09,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:09,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010017501] [2025-03-08 06:53:09,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:09,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:09,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:09,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:09,621 INFO L87 Difference]: Start difference. First operand 3867 states and 6658 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:10,156 INFO L93 Difference]: Finished difference Result 7722 states and 12757 transitions. [2025-03-08 06:53:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:10,180 INFO L225 Difference]: With dead ends: 7722 [2025-03-08 06:53:10,180 INFO L226 Difference]: Without dead ends: 5989 [2025-03-08 06:53:10,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:10,189 INFO L435 NwaCegarLoop]: 4327 mSDtfsCounter, 4646 mSDsluCounter, 12970 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 17297 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:10,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 17297 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2025-03-08 06:53:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5553. [2025-03-08 06:53:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5553 states, 5148 states have (on average 1.6833721833721833) internal successors, (8666), 5216 states have internal predecessors, (8666), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-08 06:53:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 9392 transitions. [2025-03-08 06:53:10,353 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 9392 transitions. Word has length 99 [2025-03-08 06:53:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:10,353 INFO L471 AbstractCegarLoop]: Abstraction has 5553 states and 9392 transitions. [2025-03-08 06:53:10,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 9392 transitions. [2025-03-08 06:53:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:10,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:10,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:10,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:53:10,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:10,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -581927515, now seen corresponding path program 1 times [2025-03-08 06:53:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:10,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378295182] [2025-03-08 06:53:10,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:10,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:10,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:10,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:10,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:10,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378295182] [2025-03-08 06:53:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378295182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:10,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585642962] [2025-03-08 06:53:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:10,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:10,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:10,428 INFO L87 Difference]: Start difference. First operand 5553 states and 9392 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:10,860 INFO L93 Difference]: Finished difference Result 9470 states and 15844 transitions. [2025-03-08 06:53:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:10,896 INFO L225 Difference]: With dead ends: 9470 [2025-03-08 06:53:10,897 INFO L226 Difference]: Without dead ends: 6051 [2025-03-08 06:53:10,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:10,907 INFO L435 NwaCegarLoop]: 4170 mSDtfsCounter, 4346 mSDsluCounter, 8254 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 12424 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:10,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 12424 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2025-03-08 06:53:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 5553. [2025-03-08 06:53:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5553 states, 5148 states have (on average 1.68006993006993) internal successors, (8649), 5216 states have internal predecessors, (8649), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-08 06:53:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 9375 transitions. [2025-03-08 06:53:11,074 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 9375 transitions. Word has length 99 [2025-03-08 06:53:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:11,075 INFO L471 AbstractCegarLoop]: Abstraction has 5553 states and 9375 transitions. [2025-03-08 06:53:11,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 9375 transitions. [2025-03-08 06:53:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:11,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:11,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:11,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:53:11,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:11,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash 526887684, now seen corresponding path program 1 times [2025-03-08 06:53:11,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475827741] [2025-03-08 06:53:11,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:11,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:11,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:11,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475827741] [2025-03-08 06:53:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475827741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801874623] [2025-03-08 06:53:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:11,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:11,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:11,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:11,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:11,190 INFO L87 Difference]: Start difference. First operand 5553 states and 9375 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:11,817 INFO L93 Difference]: Finished difference Result 13110 states and 21742 transitions. [2025-03-08 06:53:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:11,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:11,848 INFO L225 Difference]: With dead ends: 13110 [2025-03-08 06:53:11,848 INFO L226 Difference]: Without dead ends: 9691 [2025-03-08 06:53:11,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:11,859 INFO L435 NwaCegarLoop]: 4319 mSDtfsCounter, 4573 mSDsluCounter, 12947 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 17266 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:11,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 17266 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2025-03-08 06:53:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 9117. [2025-03-08 06:53:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 8270 states have (on average 1.6380894800483676) internal successors, (13547), 8484 states have internal predecessors, (13547), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 06:53:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 15441 transitions. [2025-03-08 06:53:12,148 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 15441 transitions. Word has length 99 [2025-03-08 06:53:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:12,148 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 15441 transitions. [2025-03-08 06:53:12,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 15441 transitions. [2025-03-08 06:53:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:12,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:12,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:12,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:53:12,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:12,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1393939909, now seen corresponding path program 1 times [2025-03-08 06:53:12,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:12,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051900276] [2025-03-08 06:53:12,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:12,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:12,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:12,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:12,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051900276] [2025-03-08 06:53:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051900276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:12,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011830413] [2025-03-08 06:53:12,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:12,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:12,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:12,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:12,231 INFO L87 Difference]: Start difference. First operand 9117 states and 15441 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:12,690 INFO L93 Difference]: Finished difference Result 17080 states and 29220 transitions. [2025-03-08 06:53:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:12,726 INFO L225 Difference]: With dead ends: 17080 [2025-03-08 06:53:12,726 INFO L226 Difference]: Without dead ends: 10097 [2025-03-08 06:53:12,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:12,745 INFO L435 NwaCegarLoop]: 4165 mSDtfsCounter, 4342 mSDsluCounter, 8245 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4355 SdHoareTripleChecker+Valid, 12410 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:12,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4355 Valid, 12410 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10097 states. [2025-03-08 06:53:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10097 to 9117. [2025-03-08 06:53:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 8270 states have (on average 1.63409915356711) internal successors, (13514), 8484 states have internal predecessors, (13514), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 06:53:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 15408 transitions. [2025-03-08 06:53:13,072 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 15408 transitions. Word has length 99 [2025-03-08 06:53:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:13,072 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 15408 transitions. [2025-03-08 06:53:13,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 15408 transitions. [2025-03-08 06:53:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:13,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:13,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:13,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:53:13,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1837551332, now seen corresponding path program 1 times [2025-03-08 06:53:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143050816] [2025-03-08 06:53:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:13,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:13,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:13,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:13,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143050816] [2025-03-08 06:53:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143050816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367146086] [2025-03-08 06:53:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:13,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:13,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:13,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:13,180 INFO L87 Difference]: Start difference. First operand 9117 states and 15408 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:13,795 INFO L93 Difference]: Finished difference Result 16835 states and 28664 transitions. [2025-03-08 06:53:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:13,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:13,833 INFO L225 Difference]: With dead ends: 16835 [2025-03-08 06:53:13,834 INFO L226 Difference]: Without dead ends: 9852 [2025-03-08 06:53:13,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:13,858 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4339 mSDsluCounter, 8240 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 12402 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:13,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 12402 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9852 states. [2025-03-08 06:53:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9852 to 9117. [2025-03-08 06:53:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 8270 states have (on average 1.6301088270858526) internal successors, (13481), 8484 states have internal predecessors, (13481), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 06:53:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 15375 transitions. [2025-03-08 06:53:14,190 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 15375 transitions. Word has length 99 [2025-03-08 06:53:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:14,191 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 15375 transitions. [2025-03-08 06:53:14,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 15375 transitions. [2025-03-08 06:53:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:14,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:14,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:53:14,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:14,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash 882030053, now seen corresponding path program 1 times [2025-03-08 06:53:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746259552] [2025-03-08 06:53:14,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:14,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:14,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:14,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:14,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746259552] [2025-03-08 06:53:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746259552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:14,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242891081] [2025-03-08 06:53:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:14,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:14,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:14,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:14,283 INFO L87 Difference]: Start difference. First operand 9117 states and 15375 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:15,109 INFO L93 Difference]: Finished difference Result 23602 states and 40544 transitions. [2025-03-08 06:53:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:15,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:15,176 INFO L225 Difference]: With dead ends: 23602 [2025-03-08 06:53:15,176 INFO L226 Difference]: Without dead ends: 16619 [2025-03-08 06:53:15,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:15,202 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4462 mSDsluCounter, 12910 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 17216 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:15,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 17216 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:53:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16619 states. [2025-03-08 06:53:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16619 to 16278. [2025-03-08 06:53:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16278 states, 14401 states have (on average 1.58607041177696) internal successors, (22841), 15069 states have internal predecessors, (22841), 819 states have call successors, (819), 390 states have call predecessors, (819), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-08 06:53:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16278 states to 16278 states and 28575 transitions. [2025-03-08 06:53:15,906 INFO L78 Accepts]: Start accepts. Automaton has 16278 states and 28575 transitions. Word has length 99 [2025-03-08 06:53:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:15,906 INFO L471 AbstractCegarLoop]: Abstraction has 16278 states and 28575 transitions. [2025-03-08 06:53:15,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 16278 states and 28575 transitions. [2025-03-08 06:53:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:53:15,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:15,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:15,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:53:15,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:15,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1227003196, now seen corresponding path program 1 times [2025-03-08 06:53:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:15,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814819433] [2025-03-08 06:53:15,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:15,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:53:15,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:53:15,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:15,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:15,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:15,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814819433] [2025-03-08 06:53:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814819433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:15,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:15,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:53:15,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429933063] [2025-03-08 06:53:15,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:15,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:53:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:15,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:53:15,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:53:15,973 INFO L87 Difference]: Start difference. First operand 16278 states and 28575 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:17,283 INFO L93 Difference]: Finished difference Result 44301 states and 78093 transitions. [2025-03-08 06:53:17,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:17,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:53:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:17,411 INFO L225 Difference]: With dead ends: 44301 [2025-03-08 06:53:17,411 INFO L226 Difference]: Without dead ends: 30158 [2025-03-08 06:53:17,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:53:17,456 INFO L435 NwaCegarLoop]: 4519 mSDtfsCounter, 4472 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4472 SdHoareTripleChecker+Valid, 8967 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:17,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4472 Valid, 8967 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:53:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30158 states. [2025-03-08 06:53:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30158 to 30093. [2025-03-08 06:53:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30093 states, 26345 states have (on average 1.550996394002657) internal successors, (40861), 27744 states have internal predecessors, (40861), 1634 states have call successors, (1634), 780 states have call predecessors, (1634), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-08 06:53:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30093 states to 30093 states and 52258 transitions. [2025-03-08 06:53:19,153 INFO L78 Accepts]: Start accepts. Automaton has 30093 states and 52258 transitions. Word has length 99 [2025-03-08 06:53:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:19,154 INFO L471 AbstractCegarLoop]: Abstraction has 30093 states and 52258 transitions. [2025-03-08 06:53:19,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:53:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 30093 states and 52258 transitions. [2025-03-08 06:53:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 06:53:19,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:19,193 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, 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, 1, 1, 1, 1, 1] [2025-03-08 06:53:19,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:53:19,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:19,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 691072027, now seen corresponding path program 1 times [2025-03-08 06:53:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012460298] [2025-03-08 06:53:19,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:19,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:19,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:19,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:19,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:53:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012460298] [2025-03-08 06:53:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012460298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:53:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262740776] [2025-03-08 06:53:19,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:19,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:53:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:53:19,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:53:19,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:53:19,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:19,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:19,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:19,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:19,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:53:19,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:53:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 06:53:19,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:53:19,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262740776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:19,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:53:19,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:53:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130778886] [2025-03-08 06:53:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:19,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:53:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:19,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:53:19,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:19,450 INFO L87 Difference]: Start difference. First operand 30093 states and 52258 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:53:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:21,295 INFO L93 Difference]: Finished difference Result 85358 states and 148558 transitions. [2025-03-08 06:53:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:53:21,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 161 [2025-03-08 06:53:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:21,503 INFO L225 Difference]: With dead ends: 85358 [2025-03-08 06:53:21,503 INFO L226 Difference]: Without dead ends: 57400 [2025-03-08 06:53:21,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:21,570 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4205 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4205 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:21,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4205 Valid, 4524 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:53:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57400 states. [2025-03-08 06:53:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57400 to 57268. [2025-03-08 06:53:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57268 states, 49908 states have (on average 1.5369479842910956) internal successors, (76706), 52704 states have internal predecessors, (76706), 3134 states have call successors, (3134), 1560 states have call predecessors, (3134), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-08 06:53:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57268 states to 57268 states and 99169 transitions. [2025-03-08 06:53:24,995 INFO L78 Accepts]: Start accepts. Automaton has 57268 states and 99169 transitions. Word has length 161 [2025-03-08 06:53:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:24,996 INFO L471 AbstractCegarLoop]: Abstraction has 57268 states and 99169 transitions. [2025-03-08 06:53:24,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:53:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 57268 states and 99169 transitions. [2025-03-08 06:53:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 06:53:25,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:25,059 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, 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, 1, 1, 1, 1, 1] [2025-03-08 06:53:25,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:53:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:53:25,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 363276065, now seen corresponding path program 1 times [2025-03-08 06:53:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115229533] [2025-03-08 06:53:25,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:25,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:25,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:25,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:25,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:53:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115229533] [2025-03-08 06:53:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115229533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:53:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27275446] [2025-03-08 06:53:25,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:25,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:53:25,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:53:25,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:53:25,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:53:25,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:25,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:25,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:25,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:25,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:53:25,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:53:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 06:53:25,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:53:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27275446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:25,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:53:25,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:53:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428737753] [2025-03-08 06:53:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:25,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:53:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:25,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:53:25,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:25,527 INFO L87 Difference]: Start difference. First operand 57268 states and 99169 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:53:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:30,525 INFO L93 Difference]: Finished difference Result 166233 states and 288971 transitions. [2025-03-08 06:53:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:53:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 161 [2025-03-08 06:53:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:30,969 INFO L225 Difference]: With dead ends: 166233 [2025-03-08 06:53:30,969 INFO L226 Difference]: Without dead ends: 111100 [2025-03-08 06:53:31,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:31,102 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4199 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4199 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:31,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4199 Valid, 4524 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:53:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111100 states. [2025-03-08 06:53:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111100 to 110838. [2025-03-08 06:53:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110838 states, 96384 states have (on average 1.5288429614873837) internal successors, (147356), 101974 states have internal predecessors, (147356), 6004 states have call successors, (6004), 3120 states have call predecessors, (6004), 8448 states have return successors, (38331), 5807 states have call predecessors, (38331), 6004 states have call successors, (38331) [2025-03-08 06:53:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110838 states to 110838 states and 191691 transitions. [2025-03-08 06:53:36,157 INFO L78 Accepts]: Start accepts. Automaton has 110838 states and 191691 transitions. Word has length 161 [2025-03-08 06:53:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 110838 states and 191691 transitions. [2025-03-08 06:53:36,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:53:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 110838 states and 191691 transitions. [2025-03-08 06:53:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 06:53:36,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:36,247 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, 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, 1, 1, 1, 1, 1] [2025-03-08 06:53:36,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:53:36,447 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,SelfDestructingSolverStorable13 [2025-03-08 06:53:36,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:36,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 974102183, now seen corresponding path program 1 times [2025-03-08 06:53:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:36,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17791271] [2025-03-08 06:53:36,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:36,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:36,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:36,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:36,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:53:36,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17791271] [2025-03-08 06:53:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17791271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:53:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762529668] [2025-03-08 06:53:36,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:36,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:53:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:53:36,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:53:36,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:53:36,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:36,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:36,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:36,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:36,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:53:36,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:53:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:53:36,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:53:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762529668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:36,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:53:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:53:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733426893] [2025-03-08 06:53:36,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:36,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:53:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:36,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:53:36,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:36,693 INFO L87 Difference]: Start difference. First operand 110838 states and 191691 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:53:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:44,750 INFO L93 Difference]: Finished difference Result 326411 states and 567047 transitions. [2025-03-08 06:53:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:53:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 161 [2025-03-08 06:53:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:45,559 INFO L225 Difference]: With dead ends: 326411 [2025-03-08 06:53:45,559 INFO L226 Difference]: Without dead ends: 217708 [2025-03-08 06:53:45,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:45,819 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4187 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4187 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:45,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4187 Valid, 4524 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:53:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217708 states. [2025-03-08 06:53:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217708 to 217186. [2025-03-08 06:53:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217186 states, 188548 states have (on average 1.5226255383244585) internal successors, (287088), 199726 states have internal predecessors, (287088), 11740 states have call successors, (11740), 6240 states have call predecessors, (11740), 16896 states have return successors, (76331), 11283 states have call predecessors, (76331), 11740 states have call successors, (76331) [2025-03-08 06:53:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217186 states to 217186 states and 375159 transitions. [2025-03-08 06:53:58,962 INFO L78 Accepts]: Start accepts. Automaton has 217186 states and 375159 transitions. Word has length 161 [2025-03-08 06:53:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:58,962 INFO L471 AbstractCegarLoop]: Abstraction has 217186 states and 375159 transitions. [2025-03-08 06:53:58,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:53:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 217186 states and 375159 transitions. [2025-03-08 06:53:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 06:53:59,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:59,175 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, 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, 1, 1, 1, 1, 1] [2025-03-08 06:53:59,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:53:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:53:59,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -570773715, now seen corresponding path program 1 times [2025-03-08 06:53:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645709441] [2025-03-08 06:53:59,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:59,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:59,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:59,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:59,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:53:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645709441] [2025-03-08 06:53:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645709441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:53:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30256841] [2025-03-08 06:53:59,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:59,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:53:59,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:53:59,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:53:59,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:53:59,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:53:59,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:53:59,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:59,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:53:59,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:53:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 06:53:59,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:53:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30256841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:59,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:53:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:53:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436352859] [2025-03-08 06:53:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:59,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:53:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:59,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:53:59,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:59,602 INFO L87 Difference]: Start difference. First operand 217186 states and 375159 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)