./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c633b25b4ec43f32a8252bdc35a2fbecdeeeba9961d16af4e4c5eb75bb72dd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:15:05,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:15:05,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:15:05,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:15:05,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:15:05,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:15:05,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:15:05,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:15:05,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:15:05,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:15:05,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:15:05,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:15:05,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:15:05,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:15:05,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:15:05,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:15:05,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:15:05,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:15:05,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:15:05,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c633b25b4ec43f32a8252bdc35a2fbecdeeeba9961d16af4e4c5eb75bb72dd2 [2025-02-05 17:15:06,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:15:06,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:15:06,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:15:06,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:15:06,055 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:15:06,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c [2025-02-05 17:15:07,393 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f0c6caa8/b752c7a51fe04005b08fe408c1e172c3/FLAG675f1faa0 [2025-02-05 17:15:08,055 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:15:08,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c [2025-02-05 17:15:08,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f0c6caa8/b752c7a51fe04005b08fe408c1e172c3/FLAG675f1faa0 [2025-02-05 17:15:08,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f0c6caa8/b752c7a51fe04005b08fe408c1e172c3 [2025-02-05 17:15:08,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:15:08,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:15:08,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:15:08,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:15:08,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:15:08,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:15:08" (1/1) ... [2025-02-05 17:15:08,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcac649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:08, skipping insertion in model container [2025-02-05 17:15:08,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:15:08" (1/1) ... [2025-02-05 17:15:08,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:15:09,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[382357,382370] [2025-02-05 17:15:09,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[383339,383352] [2025-02-05 17:15:09,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:15:09,685 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:15:10,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[382357,382370] [2025-02-05 17:15:10,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[383339,383352] [2025-02-05 17:15:10,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:15:10,270 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:15:10,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10 WrapperNode [2025-02-05 17:15:10,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:15:10,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:15:10,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:15:10,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:15:10,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:10,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:10,693 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12906 [2025-02-05 17:15:10,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:15:10,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:15:10,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:15:10,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:15:10,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:10,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:10,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:10,875 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-02-05 17:15:10,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:10,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:10,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:11,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:11,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:11,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:11,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:15:11,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:15:11,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:15:11,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:15:11,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (1/1) ... [2025-02-05 17:15:11,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:15:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:15:11,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:15:11,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:15:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:15:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:15:11,173 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:15:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:15:11,173 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:15:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:15:11,173 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:15:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:15:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:15:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:15:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:15:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:15:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:15:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:15:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:15:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:15:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:15:11,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:15:11,276 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:15:11,278 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:15:17,221 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:15:17,221 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:15:17,221 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:15:17,221 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:15:17,222 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:15:17,222 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:15:17,222 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:15:17,424 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2025-02-05 17:15:17,424 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:15:17,474 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:15:17,477 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:15:17,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:15:17 BoogieIcfgContainer [2025-02-05 17:15:17,478 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:15:17,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:15:17,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:15:17,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:15:17,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:15:08" (1/3) ... [2025-02-05 17:15:17,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8482b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:15:17, skipping insertion in model container [2025-02-05 17:15:17,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:10" (2/3) ... [2025-02-05 17:15:17,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8482b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:15:17, skipping insertion in model container [2025-02-05 17:15:17,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:15:17" (3/3) ... [2025-02-05 17:15:17,491 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.07.cil-2.c [2025-02-05 17:15:17,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:15:17,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.07.cil-2.c that has 8 procedures, 2464 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-02-05 17:15:17,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:15:17,604 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;@7c11e4b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:15:17,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:15:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 2464 states, 2431 states have (on average 1.8399835458658989) internal successors, (4473), 2436 states have internal predecessors, (4473), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 17:15:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:17,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:17,632 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, 1, 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-02-05 17:15:17,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:17,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1066878044, now seen corresponding path program 1 times [2025-02-05 17:15:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75494875] [2025-02-05 17:15:17,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:17,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75494875] [2025-02-05 17:15:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75494875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:18,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:18,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976624664] [2025-02-05 17:15:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:18,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:18,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:18,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:18,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:18,207 INFO L87 Difference]: Start difference. First operand has 2464 states, 2431 states have (on average 1.8399835458658989) internal successors, (4473), 2436 states have internal predecessors, (4473), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:18,567 INFO L93 Difference]: Finished difference Result 4926 states and 9043 transitions. [2025-02-05 17:15:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:18,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:18,591 INFO L225 Difference]: With dead ends: 4926 [2025-02-05 17:15:18,592 INFO L226 Difference]: Without dead ends: 2412 [2025-02-05 17:15:18,602 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-02-05 17:15:18,605 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4572 mSDsluCounter, 8577 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4587 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:18,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4587 Valid, 12920 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2025-02-05 17:15:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2396. [2025-02-05 17:15:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2365 states have (on average 1.831289640591966) internal successors, (4331), 2368 states have internal predecessors, (4331), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 17:15:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 4375 transitions. [2025-02-05 17:15:18,732 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 4375 transitions. Word has length 124 [2025-02-05 17:15:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 4375 transitions. [2025-02-05 17:15:18,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 4375 transitions. [2025-02-05 17:15:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:18,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:18,739 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, 1, 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-02-05 17:15:18,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:15:18,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:18,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:18,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1007657307, now seen corresponding path program 1 times [2025-02-05 17:15:18,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:18,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922512095] [2025-02-05 17:15:18,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:18,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:18,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:18,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:18,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922512095] [2025-02-05 17:15:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922512095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:19,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990209862] [2025-02-05 17:15:19,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:19,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:19,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:19,061 INFO L87 Difference]: Start difference. First operand 2396 states and 4375 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:19,642 INFO L93 Difference]: Finished difference Result 2960 states and 5251 transitions. [2025-02-05 17:15:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:19,654 INFO L225 Difference]: With dead ends: 2960 [2025-02-05 17:15:19,654 INFO L226 Difference]: Without dead ends: 2700 [2025-02-05 17:15:19,656 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-02-05 17:15:19,657 INFO L435 NwaCegarLoop]: 4513 mSDtfsCounter, 4705 mSDsluCounter, 13650 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 18163 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:19,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 18163 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-02-05 17:15:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2666. [2025-02-05 17:15:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2609 states have (on average 1.8041395170563435) internal successors, (4707), 2614 states have internal predecessors, (4707), 41 states have call successors, (41), 13 states have call predecessors, (41), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-02-05 17:15:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4794 transitions. [2025-02-05 17:15:19,731 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4794 transitions. Word has length 124 [2025-02-05 17:15:19,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:19,732 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4794 transitions. [2025-02-05 17:15:19,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4794 transitions. [2025-02-05 17:15:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:19,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:19,734 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, 1, 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-02-05 17:15:19,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:15:19,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -313010300, now seen corresponding path program 1 times [2025-02-05 17:15:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068048336] [2025-02-05 17:15:19,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:19,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:19,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:19,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:19,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068048336] [2025-02-05 17:15:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068048336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:19,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:19,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633496811] [2025-02-05 17:15:19,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:19,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:19,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:19,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:19,871 INFO L87 Difference]: Start difference. First operand 2666 states and 4794 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:20,428 INFO L93 Difference]: Finished difference Result 3766 states and 6503 transitions. [2025-02-05 17:15:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:20,443 INFO L225 Difference]: With dead ends: 3766 [2025-02-05 17:15:20,443 INFO L226 Difference]: Without dead ends: 3238 [2025-02-05 17:15:20,446 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-02-05 17:15:20,448 INFO L435 NwaCegarLoop]: 4479 mSDtfsCounter, 4701 mSDsluCounter, 13579 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4716 SdHoareTripleChecker+Valid, 18058 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:20,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4716 Valid, 18058 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2025-02-05 17:15:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 3192. [2025-02-05 17:15:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 3087 states have (on average 1.7622287010042113) internal successors, (5440), 3096 states have internal predecessors, (5440), 73 states have call successors, (73), 25 states have call predecessors, (73), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-02-05 17:15:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 5607 transitions. [2025-02-05 17:15:20,559 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 5607 transitions. Word has length 124 [2025-02-05 17:15:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:20,560 INFO L471 AbstractCegarLoop]: Abstraction has 3192 states and 5607 transitions. [2025-02-05 17:15:20,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 5607 transitions. [2025-02-05 17:15:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:20,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:20,562 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, 1, 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-02-05 17:15:20,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:15:20,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 817776325, now seen corresponding path program 1 times [2025-02-05 17:15:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775615606] [2025-02-05 17:15:20,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:20,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:20,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:20,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:20,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775615606] [2025-02-05 17:15:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775615606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:20,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858261062] [2025-02-05 17:15:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:20,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:20,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:20,745 INFO L87 Difference]: Start difference. First operand 3192 states and 5607 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:21,340 INFO L93 Difference]: Finished difference Result 5441 states and 9142 transitions. [2025-02-05 17:15:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:21,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:21,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:21,360 INFO L225 Difference]: With dead ends: 5441 [2025-02-05 17:15:21,360 INFO L226 Difference]: Without dead ends: 4387 [2025-02-05 17:15:21,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-02-05 17:15:21,367 INFO L435 NwaCegarLoop]: 4476 mSDtfsCounter, 4696 mSDsluCounter, 13566 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4711 SdHoareTripleChecker+Valid, 18042 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:21,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4711 Valid, 18042 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2025-02-05 17:15:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 4318. [2025-02-05 17:15:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4318 states, 4111 states have (on average 1.7110192167355875) internal successors, (7034), 4134 states have internal predecessors, (7034), 137 states have call successors, (137), 49 states have call predecessors, (137), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-02-05 17:15:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 7385 transitions. [2025-02-05 17:15:21,558 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 7385 transitions. Word has length 124 [2025-02-05 17:15:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:21,559 INFO L471 AbstractCegarLoop]: Abstraction has 4318 states and 7385 transitions. [2025-02-05 17:15:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 7385 transitions. [2025-02-05 17:15:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:21,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:21,566 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, 1, 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-02-05 17:15:21,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:15:21,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:21,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash -115578012, now seen corresponding path program 1 times [2025-02-05 17:15:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012821346] [2025-02-05 17:15:21,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:21,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:21,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:21,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012821346] [2025-02-05 17:15:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012821346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832987343] [2025-02-05 17:15:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:21,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:21,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:21,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:21,735 INFO L87 Difference]: Start difference. First operand 4318 states and 7385 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:22,427 INFO L93 Difference]: Finished difference Result 9068 states and 15016 transitions. [2025-02-05 17:15:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:22,463 INFO L225 Difference]: With dead ends: 9068 [2025-02-05 17:15:22,463 INFO L226 Difference]: Without dead ends: 6888 [2025-02-05 17:15:22,470 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-02-05 17:15:22,471 INFO L435 NwaCegarLoop]: 4475 mSDtfsCounter, 4691 mSDsluCounter, 13555 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4706 SdHoareTripleChecker+Valid, 18030 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:22,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 18030 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6888 states. [2025-02-05 17:15:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6888 to 6776. [2025-02-05 17:15:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6776 states, 6347 states have (on average 1.6662990389160233) internal successors, (10576), 6416 states have internal predecessors, (10576), 265 states have call successors, (265), 97 states have call predecessors, (265), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-02-05 17:15:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 11391 transitions. [2025-02-05 17:15:22,698 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 11391 transitions. Word has length 124 [2025-02-05 17:15:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:22,699 INFO L471 AbstractCegarLoop]: Abstraction has 6776 states and 11391 transitions. [2025-02-05 17:15:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 11391 transitions. [2025-02-05 17:15:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:22,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:22,709 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, 1, 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-02-05 17:15:22,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:15:22,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:22,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1378334437, now seen corresponding path program 1 times [2025-02-05 17:15:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:22,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092850666] [2025-02-05 17:15:22,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:22,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:22,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:22,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:22,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092850666] [2025-02-05 17:15:22,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092850666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:22,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:22,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586246748] [2025-02-05 17:15:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:22,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:22,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:22,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:22,838 INFO L87 Difference]: Start difference. First operand 6776 states and 11391 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:23,448 INFO L93 Difference]: Finished difference Result 17087 states and 28546 transitions. [2025-02-05 17:15:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:23,519 INFO L225 Difference]: With dead ends: 17087 [2025-02-05 17:15:23,519 INFO L226 Difference]: Without dead ends: 12449 [2025-02-05 17:15:23,537 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-02-05 17:15:23,539 INFO L435 NwaCegarLoop]: 4471 mSDtfsCounter, 4686 mSDsluCounter, 13538 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4701 SdHoareTripleChecker+Valid, 18009 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:23,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4701 Valid, 18009 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2025-02-05 17:15:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 12258. [2025-02-05 17:15:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12258 states, 11331 states have (on average 1.6434560056482217) internal successors, (18622), 11546 states have internal predecessors, (18622), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:15:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 20749 transitions. [2025-02-05 17:15:24,029 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 20749 transitions. Word has length 124 [2025-02-05 17:15:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:24,030 INFO L471 AbstractCegarLoop]: Abstraction has 12258 states and 20749 transitions. [2025-02-05 17:15:24,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 20749 transitions. [2025-02-05 17:15:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:24,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:24,037 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, 1, 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-02-05 17:15:24,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:15:24,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:24,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash 179599172, now seen corresponding path program 1 times [2025-02-05 17:15:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:24,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150433886] [2025-02-05 17:15:24,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:24,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:24,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:24,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:24,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:24,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-02-05 17:15:24,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:24,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150433886] [2025-02-05 17:15:24,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150433886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:24,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:24,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:24,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777291899] [2025-02-05 17:15:24,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:24,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:24,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:24,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:24,118 INFO L87 Difference]: Start difference. First operand 12258 states and 20749 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:24,537 INFO L93 Difference]: Finished difference Result 24810 states and 42799 transitions. [2025-02-05 17:15:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:24,585 INFO L225 Difference]: With dead ends: 24810 [2025-02-05 17:15:24,586 INFO L226 Difference]: Without dead ends: 14688 [2025-02-05 17:15:24,625 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-02-05 17:15:24,627 INFO L435 NwaCegarLoop]: 4263 mSDtfsCounter, 4497 mSDsluCounter, 8418 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4512 SdHoareTripleChecker+Valid, 12681 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:24,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4512 Valid, 12681 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2025-02-05 17:15:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12258. [2025-02-05 17:15:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12258 states, 11331 states have (on average 1.6405436413379224) internal successors, (18589), 11546 states have internal predecessors, (18589), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:15:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 20716 transitions. [2025-02-05 17:15:25,125 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 20716 transitions. Word has length 124 [2025-02-05 17:15:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:25,126 INFO L471 AbstractCegarLoop]: Abstraction has 12258 states and 20716 transitions. [2025-02-05 17:15:25,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 20716 transitions. [2025-02-05 17:15:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:25,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:25,134 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, 1, 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-02-05 17:15:25,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:15:25,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash 695119621, now seen corresponding path program 1 times [2025-02-05 17:15:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:25,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410147048] [2025-02-05 17:15:25,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:25,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:25,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:25,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410147048] [2025-02-05 17:15:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410147048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429819867] [2025-02-05 17:15:25,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:25,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:25,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:25,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:25,215 INFO L87 Difference]: Start difference. First operand 12258 states and 20716 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:25,679 INFO L93 Difference]: Finished difference Result 24324 states and 41761 transitions. [2025-02-05 17:15:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:25,730 INFO L225 Difference]: With dead ends: 24324 [2025-02-05 17:15:25,730 INFO L226 Difference]: Without dead ends: 14202 [2025-02-05 17:15:25,760 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-02-05 17:15:25,761 INFO L435 NwaCegarLoop]: 4258 mSDtfsCounter, 4491 mSDsluCounter, 8407 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4506 SdHoareTripleChecker+Valid, 12665 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:25,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4506 Valid, 12665 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14202 states. [2025-02-05 17:15:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14202 to 12258. [2025-02-05 17:15:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12258 states, 11331 states have (on average 1.6376312770276233) internal successors, (18556), 11546 states have internal predecessors, (18556), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:15:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 20683 transitions. [2025-02-05 17:15:26,411 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 20683 transitions. Word has length 124 [2025-02-05 17:15:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:26,413 INFO L471 AbstractCegarLoop]: Abstraction has 12258 states and 20683 transitions. [2025-02-05 17:15:26,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 20683 transitions. [2025-02-05 17:15:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:26,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:26,421 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, 1, 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-02-05 17:15:26,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:15:26,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:26,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1495655174, now seen corresponding path program 1 times [2025-02-05 17:15:26,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:26,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649931624] [2025-02-05 17:15:26,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:26,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:26,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:26,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:26,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:26,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649931624] [2025-02-05 17:15:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649931624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:26,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870259488] [2025-02-05 17:15:26,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:26,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:26,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:26,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:26,558 INFO L87 Difference]: Start difference. First operand 12258 states and 20683 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:27,677 INFO L93 Difference]: Finished difference Result 35669 states and 61171 transitions. [2025-02-05 17:15:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:27,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:27,761 INFO L225 Difference]: With dead ends: 35669 [2025-02-05 17:15:27,761 INFO L226 Difference]: Without dead ends: 25549 [2025-02-05 17:15:27,784 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-02-05 17:15:27,785 INFO L435 NwaCegarLoop]: 4456 mSDtfsCounter, 4827 mSDsluCounter, 13470 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4850 SdHoareTripleChecker+Valid, 17926 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:27,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4850 Valid, 17926 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25549 states. [2025-02-05 17:15:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25549 to 23938. [2025-02-05 17:15:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23938 states, 21885 states have (on average 1.62860406671236) internal successors, (35642), 22554 states have internal predecessors, (35642), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:15:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23938 states to 23938 states and 41865 transitions. [2025-02-05 17:15:28,525 INFO L78 Accepts]: Start accepts. Automaton has 23938 states and 41865 transitions. Word has length 124 [2025-02-05 17:15:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:28,527 INFO L471 AbstractCegarLoop]: Abstraction has 23938 states and 41865 transitions. [2025-02-05 17:15:28,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 23938 states and 41865 transitions. [2025-02-05 17:15:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:28,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:28,537 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, 1, 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-02-05 17:15:28,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:15:28,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash 967289573, now seen corresponding path program 1 times [2025-02-05 17:15:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322727885] [2025-02-05 17:15:28,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:28,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:28,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:28,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:28,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:28,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322727885] [2025-02-05 17:15:28,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322727885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:28,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574506975] [2025-02-05 17:15:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:28,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:28,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:28,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:28,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:28,709 INFO L87 Difference]: Start difference. First operand 23938 states and 41865 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:29,484 INFO L93 Difference]: Finished difference Result 50114 states and 90661 transitions. [2025-02-05 17:15:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:29,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:29,579 INFO L225 Difference]: With dead ends: 50114 [2025-02-05 17:15:29,580 INFO L226 Difference]: Without dead ends: 28312 [2025-02-05 17:15:29,630 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-02-05 17:15:29,631 INFO L435 NwaCegarLoop]: 4253 mSDtfsCounter, 4487 mSDsluCounter, 8398 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 12651 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:29,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 12651 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28312 states. [2025-02-05 17:15:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28312 to 23938. [2025-02-05 17:15:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23938 states, 21885 states have (on average 1.6256339958875943) internal successors, (35577), 22554 states have internal predecessors, (35577), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:15:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23938 states to 23938 states and 41800 transitions. [2025-02-05 17:15:30,892 INFO L78 Accepts]: Start accepts. Automaton has 23938 states and 41800 transitions. Word has length 124 [2025-02-05 17:15:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:30,893 INFO L471 AbstractCegarLoop]: Abstraction has 23938 states and 41800 transitions. [2025-02-05 17:15:30,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 23938 states and 41800 transitions. [2025-02-05 17:15:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:30,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:30,904 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, 1, 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-02-05 17:15:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:15:30,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:30,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1642982182, now seen corresponding path program 1 times [2025-02-05 17:15:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603500143] [2025-02-05 17:15:30,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:30,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:30,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:30,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:30,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:30,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603500143] [2025-02-05 17:15:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603500143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:30,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:30,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:30,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145721656] [2025-02-05 17:15:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:30,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:30,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:30,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:30,995 INFO L87 Difference]: Start difference. First operand 23938 states and 41800 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:32,440 INFO L93 Difference]: Finished difference Result 49385 states and 89073 transitions. [2025-02-05 17:15:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:32,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:32,659 INFO L225 Difference]: With dead ends: 49385 [2025-02-05 17:15:32,659 INFO L226 Difference]: Without dead ends: 27583 [2025-02-05 17:15:32,725 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-02-05 17:15:32,725 INFO L435 NwaCegarLoop]: 4250 mSDtfsCounter, 4484 mSDsluCounter, 8393 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 12643 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:32,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 12643 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27583 states. [2025-02-05 17:15:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27583 to 23938. [2025-02-05 17:15:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23938 states, 21885 states have (on average 1.6226639250628285) internal successors, (35512), 22554 states have internal predecessors, (35512), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:15:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23938 states to 23938 states and 41735 transitions. [2025-02-05 17:15:34,042 INFO L78 Accepts]: Start accepts. Automaton has 23938 states and 41735 transitions. Word has length 124 [2025-02-05 17:15:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:34,042 INFO L471 AbstractCegarLoop]: Abstraction has 23938 states and 41735 transitions. [2025-02-05 17:15:34,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23938 states and 41735 transitions. [2025-02-05 17:15:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:34,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:34,051 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, 1, 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-02-05 17:15:34,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:15:34,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 833494725, now seen corresponding path program 1 times [2025-02-05 17:15:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515497290] [2025-02-05 17:15:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:34,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:34,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:34,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:34,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:34,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515497290] [2025-02-05 17:15:34,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515497290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:34,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:34,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408832115] [2025-02-05 17:15:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:34,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:34,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:34,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:34,137 INFO L87 Difference]: Start difference. First operand 23938 states and 41735 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:35,963 INFO L93 Difference]: Finished difference Result 71884 states and 131525 transitions. [2025-02-05 17:15:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:36,337 INFO L225 Difference]: With dead ends: 71884 [2025-02-05 17:15:36,340 INFO L226 Difference]: Without dead ends: 50084 [2025-02-05 17:15:36,446 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-02-05 17:15:36,450 INFO L435 NwaCegarLoop]: 4443 mSDtfsCounter, 4716 mSDsluCounter, 13416 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4739 SdHoareTripleChecker+Valid, 17859 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:36,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4739 Valid, 17859 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50084 states. [2025-02-05 17:15:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50084 to 48412. [2025-02-05 17:15:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48412 states, 43653 states have (on average 1.6132224589375301) internal successors, (70422), 45716 states have internal predecessors, (70422), 1929 states have call successors, (1929), 769 states have call predecessors, (1929), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:15:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48412 states to 48412 states and 90917 transitions. [2025-02-05 17:15:39,478 INFO L78 Accepts]: Start accepts. Automaton has 48412 states and 90917 transitions. Word has length 124 [2025-02-05 17:15:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:39,479 INFO L471 AbstractCegarLoop]: Abstraction has 48412 states and 90917 transitions. [2025-02-05 17:15:39,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 48412 states and 90917 transitions. [2025-02-05 17:15:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:39,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:39,493 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, 1, 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-02-05 17:15:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:15:39,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:39,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash 391740230, now seen corresponding path program 1 times [2025-02-05 17:15:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102197311] [2025-02-05 17:15:39,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:39,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:39,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:39,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:39,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102197311] [2025-02-05 17:15:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102197311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338036300] [2025-02-05 17:15:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:39,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:39,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:39,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:39,548 INFO L87 Difference]: Start difference. First operand 48412 states and 90917 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:42,029 INFO L93 Difference]: Finished difference Result 101249 states and 201309 transitions. [2025-02-05 17:15:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:42,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:42,287 INFO L225 Difference]: With dead ends: 101249 [2025-02-05 17:15:42,288 INFO L226 Difference]: Without dead ends: 54973 [2025-02-05 17:15:42,394 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-02-05 17:15:42,395 INFO L435 NwaCegarLoop]: 4245 mSDtfsCounter, 4480 mSDsluCounter, 8384 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 12629 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:42,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 12629 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54973 states. [2025-02-05 17:15:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54973 to 48412. [2025-02-05 17:15:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48412 states, 43653 states have (on average 1.6102673355783108) internal successors, (70293), 45716 states have internal predecessors, (70293), 1929 states have call successors, (1929), 769 states have call predecessors, (1929), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:15:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48412 states to 48412 states and 90788 transitions. [2025-02-05 17:15:46,861 INFO L78 Accepts]: Start accepts. Automaton has 48412 states and 90788 transitions. Word has length 124 [2025-02-05 17:15:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:46,862 INFO L471 AbstractCegarLoop]: Abstraction has 48412 states and 90788 transitions. [2025-02-05 17:15:46,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 48412 states and 90788 transitions. [2025-02-05 17:15:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:15:46,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:46,882 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, 1, 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-02-05 17:15:46,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:15:46,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:46,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:46,883 INFO L85 PathProgramCache]: Analyzing trace with hash 377490085, now seen corresponding path program 1 times [2025-02-05 17:15:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:46,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696317713] [2025-02-05 17:15:46,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:46,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:46,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:15:46,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:15:46,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:46,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:46,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696317713] [2025-02-05 17:15:46,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696317713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:46,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:46,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:46,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560001227] [2025-02-05 17:15:46,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:46,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:46,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:46,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:46,980 INFO L87 Difference]: Start difference. First operand 48412 states and 90788 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:51,807 INFO L93 Difference]: Finished difference Result 146182 states and 301183 transitions. [2025-02-05 17:15:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:15:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:52,317 INFO L225 Difference]: With dead ends: 146182 [2025-02-05 17:15:52,317 INFO L226 Difference]: Without dead ends: 99908 [2025-02-05 17:15:52,493 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-02-05 17:15:52,493 INFO L435 NwaCegarLoop]: 4438 mSDtfsCounter, 4643 mSDsluCounter, 13390 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4666 SdHoareTripleChecker+Valid, 17828 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:52,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4666 Valid, 17828 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:15:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99908 states.