./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c633b25b4ec43f32a8252bdc35a2fbecdeeeba9961d16af4e4c5eb75bb72dd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:44:47,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:44:47,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:44:47,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:44:47,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:44:47,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:44:47,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:44:47,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:44:47,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:44:47,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:44:47,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:44:47,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:44:47,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:44:47,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:44:47,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:44:47,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:44:47,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:44:47,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:44:47,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:44:47,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:44:47,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:44:47,534 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c633b25b4ec43f32a8252bdc35a2fbecdeeeba9961d16af4e4c5eb75bb72dd2 [2025-03-03 15:44:47,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:44:47,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:44:47,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:44:47,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:44:47,793 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:44:47,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c [2025-03-03 15:44:48,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65fde583/4a4f6a32abd04cb4b945688b444b43d1/FLAGab79f6a47 [2025-03-03 15:44:49,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:44:49,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c [2025-03-03 15:44:49,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65fde583/4a4f6a32abd04cb4b945688b444b43d1/FLAGab79f6a47 [2025-03-03 15:44:49,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65fde583/4a4f6a32abd04cb4b945688b444b43d1 [2025-03-03 15:44:49,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:44:49,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:44:49,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:44:49,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:44:49,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:44:49,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:44:49" (1/1) ... [2025-03-03 15:44:49,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b4d2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:49, skipping insertion in model container [2025-03-03 15:44:49,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:44:49" (1/1) ... [2025-03-03 15:44:49,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:44:50,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[382357,382370] [2025-03-03 15:44:50,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[383339,383352] [2025-03-03 15:44:51,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:44:51,183 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:44:51,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[382357,382370] [2025-03-03 15:44:51,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[383339,383352] [2025-03-03 15:44:51,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:44:51,839 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:44:51,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51 WrapperNode [2025-03-03 15:44:51,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:44:51,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:44:51,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:44:51,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:44:51,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:51,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,341 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12906 [2025-03-03 15:44:52,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:44:52,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:44:52,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:44:52,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:44:52,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,542 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:44:52,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:44:52,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:44:52,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:44:52,781 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:44:52,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (1/1) ... [2025-03-03 15:44:52,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:44:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:52,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:44:52,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:44:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:44:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:44:52,833 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:44:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:44:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:44:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:44:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:44:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:44:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:44:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:44:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:44:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:44:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:44:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:44:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:44:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:44:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:44:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:44:52,983 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:44:52,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:44:59,306 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:44:59,306 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:44:59,307 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:44:59,307 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:44:59,308 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:44:59,308 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:44:59,309 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:44:59,532 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2025-03-03 15:44:59,532 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:44:59,600 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:44:59,600 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:44:59,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:44:59 BoogieIcfgContainer [2025-03-03 15:44:59,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:44:59,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:44:59,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:44:59,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:44:59,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:44:49" (1/3) ... [2025-03-03 15:44:59,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4406ead7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:44:59, skipping insertion in model container [2025-03-03 15:44:59,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:51" (2/3) ... [2025-03-03 15:44:59,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4406ead7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:44:59, skipping insertion in model container [2025-03-03 15:44:59,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:44:59" (3/3) ... [2025-03-03 15:44:59,611 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.07.cil-2.c [2025-03-03 15:44:59,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:44:59,629 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-03-03 15:44:59,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:44:59,741 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;@535e7dd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:44:59,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:44:59,752 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-03-03 15:44:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:44:59,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:59,766 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-03-03 15:44:59,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1066878044, now seen corresponding path program 1 times [2025-03-03 15:44:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759049013] [2025-03-03 15:44:59,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:59,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:44:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:44:59,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:59,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759049013] [2025-03-03 15:45:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759049013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:00,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:00,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499597253] [2025-03-03 15:45:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:00,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:00,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:00,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:00,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:00,343 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-03-03 15:45:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:00,920 INFO L93 Difference]: Finished difference Result 4926 states and 9043 transitions. [2025-03-03 15:45:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:00,921 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-03-03 15:45:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:00,946 INFO L225 Difference]: With dead ends: 4926 [2025-03-03 15:45:00,946 INFO L226 Difference]: Without dead ends: 2412 [2025-03-03 15:45:00,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:00,962 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.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:00,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4587 Valid, 12920 Invalid, 338 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:45:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2025-03-03 15:45:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2396. [2025-03-03 15:45:01,073 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-03-03 15:45:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 4375 transitions. [2025-03-03 15:45:01,089 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 4375 transitions. Word has length 124 [2025-03-03 15:45:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 4375 transitions. [2025-03-03 15:45:01,091 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-03-03 15:45:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 4375 transitions. [2025-03-03 15:45:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:01,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:01,097 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-03-03 15:45:01,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:45:01,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:01,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1007657307, now seen corresponding path program 1 times [2025-03-03 15:45:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594634014] [2025-03-03 15:45:01,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:01,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:01,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:01,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:01,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:01,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594634014] [2025-03-03 15:45:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594634014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242123831] [2025-03-03 15:45:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:01,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:01,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:01,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:01,346 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-03-03 15:45:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:01,962 INFO L93 Difference]: Finished difference Result 2960 states and 5251 transitions. [2025-03-03 15:45:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:01,962 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-03-03 15:45:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:01,973 INFO L225 Difference]: With dead ends: 2960 [2025-03-03 15:45:01,974 INFO L226 Difference]: Without dead ends: 2700 [2025-03-03 15:45:01,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:01,977 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:01,977 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.5s Time] [2025-03-03 15:45:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-03 15:45:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2666. [2025-03-03 15:45:02,041 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-03-03 15:45:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4794 transitions. [2025-03-03 15:45:02,054 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4794 transitions. Word has length 124 [2025-03-03 15:45:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:02,055 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4794 transitions. [2025-03-03 15:45:02,055 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-03-03 15:45:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4794 transitions. [2025-03-03 15:45:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:02,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:02,059 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-03-03 15:45:02,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:45:02,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:02,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash -313010300, now seen corresponding path program 1 times [2025-03-03 15:45:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:02,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086165207] [2025-03-03 15:45:02,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:02,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:02,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:02,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:02,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:02,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086165207] [2025-03-03 15:45:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086165207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:02,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479358723] [2025-03-03 15:45:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:02,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:02,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:02,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:02,223 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-03-03 15:45:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:02,785 INFO L93 Difference]: Finished difference Result 3766 states and 6503 transitions. [2025-03-03 15:45:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:02,786 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-03-03 15:45:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:02,800 INFO L225 Difference]: With dead ends: 3766 [2025-03-03 15:45:02,800 INFO L226 Difference]: Without dead ends: 3238 [2025-03-03 15:45:02,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:02,803 INFO L435 NwaCegarLoop]: 4479 mSDtfsCounter, 4701 mSDsluCounter, 13579 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03-03 15:45:02,804 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-03-03 15:45:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2025-03-03 15:45:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 3192. [2025-03-03 15:45:02,887 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-03-03 15:45:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 5607 transitions. [2025-03-03 15:45:02,901 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 5607 transitions. Word has length 124 [2025-03-03 15:45:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:02,901 INFO L471 AbstractCegarLoop]: Abstraction has 3192 states and 5607 transitions. [2025-03-03 15:45:02,901 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-03-03 15:45:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 5607 transitions. [2025-03-03 15:45:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:02,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:02,903 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-03-03 15:45:02,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:45:02,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:02,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash 817776325, now seen corresponding path program 1 times [2025-03-03 15:45:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868001026] [2025-03-03 15:45:02,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:02,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:02,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:02,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:02,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868001026] [2025-03-03 15:45:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868001026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352372116] [2025-03-03 15:45:03,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:03,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:03,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:03,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:03,098 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-03-03 15:45:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:03,722 INFO L93 Difference]: Finished difference Result 5441 states and 9142 transitions. [2025-03-03 15:45:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:03,722 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-03-03 15:45:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:03,745 INFO L225 Difference]: With dead ends: 5441 [2025-03-03 15:45:03,746 INFO L226 Difference]: Without dead ends: 4387 [2025-03-03 15:45:03,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:03,751 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-03-03 15:45:03,752 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-03-03 15:45:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2025-03-03 15:45:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 4318. [2025-03-03 15:45:03,887 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-03-03 15:45:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 7385 transitions. [2025-03-03 15:45:03,911 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 7385 transitions. Word has length 124 [2025-03-03 15:45:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:03,912 INFO L471 AbstractCegarLoop]: Abstraction has 4318 states and 7385 transitions. [2025-03-03 15:45:03,912 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-03-03 15:45:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 7385 transitions. [2025-03-03 15:45:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:03,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:03,919 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-03-03 15:45:03,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:45:03,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:03,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -115578012, now seen corresponding path program 1 times [2025-03-03 15:45:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:03,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308061970] [2025-03-03 15:45:03,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:03,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:03,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:03,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:03,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308061970] [2025-03-03 15:45:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308061970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447164101] [2025-03-03 15:45:04,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:04,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:04,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:04,053 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-03-03 15:45:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:04,627 INFO L93 Difference]: Finished difference Result 9068 states and 15016 transitions. [2025-03-03 15:45:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:04,628 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-03-03 15:45:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:04,658 INFO L225 Difference]: With dead ends: 9068 [2025-03-03 15:45:04,658 INFO L226 Difference]: Without dead ends: 6888 [2025-03-03 15:45:04,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:04,670 INFO L435 NwaCegarLoop]: 4475 mSDtfsCounter, 4691 mSDsluCounter, 13555 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03-03 15:45:04,670 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-03-03 15:45:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6888 states. [2025-03-03 15:45:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6888 to 6776. [2025-03-03 15:45:04,851 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-03-03 15:45:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 11391 transitions. [2025-03-03 15:45:04,878 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 11391 transitions. Word has length 124 [2025-03-03 15:45:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:04,878 INFO L471 AbstractCegarLoop]: Abstraction has 6776 states and 11391 transitions. [2025-03-03 15:45:04,878 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-03-03 15:45:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 11391 transitions. [2025-03-03 15:45:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:04,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:04,930 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-03-03 15:45:04,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:45:04,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:04,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1378334437, now seen corresponding path program 1 times [2025-03-03 15:45:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:04,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866501018] [2025-03-03 15:45:04,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:04,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:04,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:04,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:04,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866501018] [2025-03-03 15:45:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866501018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:05,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:05,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:05,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603779798] [2025-03-03 15:45:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:05,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:05,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:05,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:05,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:05,061 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-03-03 15:45:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:05,778 INFO L93 Difference]: Finished difference Result 17087 states and 28546 transitions. [2025-03-03 15:45:05,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:05,779 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-03-03 15:45:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:05,837 INFO L225 Difference]: With dead ends: 17087 [2025-03-03 15:45:05,837 INFO L226 Difference]: Without dead ends: 12449 [2025-03-03 15:45:05,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:05,856 INFO L435 NwaCegarLoop]: 4471 mSDtfsCounter, 4686 mSDsluCounter, 13538 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03-03 15:45:05,857 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-03-03 15:45:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2025-03-03 15:45:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 12258. [2025-03-03 15:45:06,251 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-03-03 15:45:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 20749 transitions. [2025-03-03 15:45:06,286 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 20749 transitions. Word has length 124 [2025-03-03 15:45:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:06,287 INFO L471 AbstractCegarLoop]: Abstraction has 12258 states and 20749 transitions. [2025-03-03 15:45:06,287 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-03-03 15:45:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 20749 transitions. [2025-03-03 15:45:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:06,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:06,294 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-03-03 15:45:06,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:45:06,294 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:06,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 179599172, now seen corresponding path program 1 times [2025-03-03 15:45:06,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:06,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148402819] [2025-03-03 15:45:06,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:06,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:06,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:06,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:06,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148402819] [2025-03-03 15:45:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148402819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:06,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:06,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299492600] [2025-03-03 15:45:06,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:06,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:06,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:06,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:06,381 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-03-03 15:45:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:06,830 INFO L93 Difference]: Finished difference Result 24810 states and 42799 transitions. [2025-03-03 15:45:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:06,830 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-03-03 15:45:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:06,887 INFO L225 Difference]: With dead ends: 24810 [2025-03-03 15:45:06,888 INFO L226 Difference]: Without dead ends: 14688 [2025-03-03 15:45:06,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:06,925 INFO L435 NwaCegarLoop]: 4263 mSDtfsCounter, 4497 mSDsluCounter, 8418 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03-03 15:45:06,926 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-03-03 15:45:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2025-03-03 15:45:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12258. [2025-03-03 15:45:07,387 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-03-03 15:45:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 20716 transitions. [2025-03-03 15:45:07,423 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 20716 transitions. Word has length 124 [2025-03-03 15:45:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:07,423 INFO L471 AbstractCegarLoop]: Abstraction has 12258 states and 20716 transitions. [2025-03-03 15:45:07,423 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-03-03 15:45:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 20716 transitions. [2025-03-03 15:45:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:07,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:07,432 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-03-03 15:45:07,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:45:07,433 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 695119621, now seen corresponding path program 1 times [2025-03-03 15:45:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:07,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145975769] [2025-03-03 15:45:07,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:07,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:07,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:07,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:07,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145975769] [2025-03-03 15:45:07,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145975769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:07,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:07,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986785987] [2025-03-03 15:45:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:07,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:07,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:07,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:07,540 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-03-03 15:45:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:08,194 INFO L93 Difference]: Finished difference Result 24324 states and 41761 transitions. [2025-03-03 15:45:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:08,194 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-03-03 15:45:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:08,268 INFO L225 Difference]: With dead ends: 24324 [2025-03-03 15:45:08,270 INFO L226 Difference]: Without dead ends: 14202 [2025-03-03 15:45:08,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:08,304 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-03-03 15:45:08,304 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-03-03 15:45:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14202 states. [2025-03-03 15:45:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14202 to 12258. [2025-03-03 15:45:08,943 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-03-03 15:45:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 20683 transitions. [2025-03-03 15:45:08,975 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 20683 transitions. Word has length 124 [2025-03-03 15:45:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:08,975 INFO L471 AbstractCegarLoop]: Abstraction has 12258 states and 20683 transitions. [2025-03-03 15:45:08,975 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-03-03 15:45:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 20683 transitions. [2025-03-03 15:45:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:08,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:08,982 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-03-03 15:45:08,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:45:08,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:08,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:08,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1495655174, now seen corresponding path program 1 times [2025-03-03 15:45:08,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:08,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545985123] [2025-03-03 15:45:08,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:08,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:08,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:08,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:08,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545985123] [2025-03-03 15:45:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545985123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474617211] [2025-03-03 15:45:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:09,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:09,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:09,093 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-03-03 15:45:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:10,069 INFO L93 Difference]: Finished difference Result 35669 states and 61171 transitions. [2025-03-03 15:45:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:10,070 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-03-03 15:45:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:10,179 INFO L225 Difference]: With dead ends: 35669 [2025-03-03 15:45:10,180 INFO L226 Difference]: Without dead ends: 25549 [2025-03-03 15:45:10,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:10,215 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-03-03 15:45:10,215 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-03-03 15:45:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25549 states. [2025-03-03 15:45:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25549 to 23938. [2025-03-03 15:45:11,188 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-03-03 15:45:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23938 states to 23938 states and 41865 transitions. [2025-03-03 15:45:11,263 INFO L78 Accepts]: Start accepts. Automaton has 23938 states and 41865 transitions. Word has length 124 [2025-03-03 15:45:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:11,265 INFO L471 AbstractCegarLoop]: Abstraction has 23938 states and 41865 transitions. [2025-03-03 15:45:11,266 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-03-03 15:45:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23938 states and 41865 transitions. [2025-03-03 15:45:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:11,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:11,276 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-03-03 15:45:11,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:45:11,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:11,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash 967289573, now seen corresponding path program 1 times [2025-03-03 15:45:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132212667] [2025-03-03 15:45:11,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:11,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:11,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:11,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132212667] [2025-03-03 15:45:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132212667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933572548] [2025-03-03 15:45:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:11,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:11,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:11,357 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-03-03 15:45:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:12,337 INFO L93 Difference]: Finished difference Result 50114 states and 90661 transitions. [2025-03-03 15:45:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:12,337 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-03-03 15:45:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:12,446 INFO L225 Difference]: With dead ends: 50114 [2025-03-03 15:45:12,446 INFO L226 Difference]: Without dead ends: 28312 [2025-03-03 15:45:12,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:12,505 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-03-03 15:45:12,506 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-03-03 15:45:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28312 states. [2025-03-03 15:45:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28312 to 23938. [2025-03-03 15:45:14,048 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-03-03 15:45:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23938 states to 23938 states and 41800 transitions. [2025-03-03 15:45:14,320 INFO L78 Accepts]: Start accepts. Automaton has 23938 states and 41800 transitions. Word has length 124 [2025-03-03 15:45:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:14,320 INFO L471 AbstractCegarLoop]: Abstraction has 23938 states and 41800 transitions. [2025-03-03 15:45:14,321 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-03-03 15:45:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23938 states and 41800 transitions. [2025-03-03 15:45:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:14,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:14,330 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-03-03 15:45:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:45:14,330 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:14,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1642982182, now seen corresponding path program 1 times [2025-03-03 15:45:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243808032] [2025-03-03 15:45:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:14,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:14,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:14,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:14,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243808032] [2025-03-03 15:45:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243808032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:14,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:14,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081478867] [2025-03-03 15:45:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:14,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:14,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:14,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:14,417 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-03-03 15:45:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:15,451 INFO L93 Difference]: Finished difference Result 49385 states and 89073 transitions. [2025-03-03 15:45:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:15,455 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-03-03 15:45:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:15,611 INFO L225 Difference]: With dead ends: 49385 [2025-03-03 15:45:15,612 INFO L226 Difference]: Without dead ends: 27583 [2025-03-03 15:45:15,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:15,664 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-03-03 15:45:15,664 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-03-03 15:45:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27583 states. [2025-03-03 15:45:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27583 to 23938. [2025-03-03 15:45:16,833 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-03-03 15:45:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23938 states to 23938 states and 41735 transitions. [2025-03-03 15:45:16,906 INFO L78 Accepts]: Start accepts. Automaton has 23938 states and 41735 transitions. Word has length 124 [2025-03-03 15:45:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:16,906 INFO L471 AbstractCegarLoop]: Abstraction has 23938 states and 41735 transitions. [2025-03-03 15:45:16,907 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-03-03 15:45:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23938 states and 41735 transitions. [2025-03-03 15:45:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:16,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:16,917 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-03-03 15:45:16,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:45:16,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:16,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 833494725, now seen corresponding path program 1 times [2025-03-03 15:45:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:16,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912635178] [2025-03-03 15:45:16,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:16,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:16,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:16,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:16,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912635178] [2025-03-03 15:45:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912635178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:17,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:17,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867438308] [2025-03-03 15:45:17,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:17,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:17,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:17,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:17,011 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-03-03 15:45:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:19,545 INFO L93 Difference]: Finished difference Result 71884 states and 131525 transitions. [2025-03-03 15:45:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:19,546 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-03-03 15:45:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:19,808 INFO L225 Difference]: With dead ends: 71884 [2025-03-03 15:45:19,808 INFO L226 Difference]: Without dead ends: 50084 [2025-03-03 15:45:19,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:19,902 INFO L435 NwaCegarLoop]: 4443 mSDtfsCounter, 4716 mSDsluCounter, 13416 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:19,902 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.5s Time] [2025-03-03 15:45:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50084 states. [2025-03-03 15:45:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50084 to 48412. [2025-03-03 15:45:22,249 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-03-03 15:45:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48412 states to 48412 states and 90917 transitions. [2025-03-03 15:45:22,531 INFO L78 Accepts]: Start accepts. Automaton has 48412 states and 90917 transitions. Word has length 124 [2025-03-03 15:45:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:22,531 INFO L471 AbstractCegarLoop]: Abstraction has 48412 states and 90917 transitions. [2025-03-03 15:45:22,531 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-03-03 15:45:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 48412 states and 90917 transitions. [2025-03-03 15:45:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:22,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:22,555 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-03-03 15:45:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:45:22,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:22,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash 391740230, now seen corresponding path program 1 times [2025-03-03 15:45:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326947988] [2025-03-03 15:45:22,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:22,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:22,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:22,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:22,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326947988] [2025-03-03 15:45:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326947988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:22,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301974081] [2025-03-03 15:45:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:22,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:22,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:22,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:22,660 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-03-03 15:45:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:26,324 INFO L93 Difference]: Finished difference Result 101249 states and 201309 transitions. [2025-03-03 15:45:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:26,324 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-03-03 15:45:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:26,633 INFO L225 Difference]: With dead ends: 101249 [2025-03-03 15:45:26,633 INFO L226 Difference]: Without dead ends: 54973 [2025-03-03 15:45:26,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:26,777 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-03-03 15:45:26,777 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-03-03 15:45:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54973 states. [2025-03-03 15:45:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54973 to 48412. [2025-03-03 15:45:30,609 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-03-03 15:45:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48412 states to 48412 states and 90788 transitions. [2025-03-03 15:45:30,782 INFO L78 Accepts]: Start accepts. Automaton has 48412 states and 90788 transitions. Word has length 124 [2025-03-03 15:45:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:30,782 INFO L471 AbstractCegarLoop]: Abstraction has 48412 states and 90788 transitions. [2025-03-03 15:45:30,782 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-03-03 15:45:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 48412 states and 90788 transitions. [2025-03-03 15:45:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:45:30,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:30,798 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-03-03 15:45:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:45:30,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 377490085, now seen corresponding path program 1 times [2025-03-03 15:45:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552025098] [2025-03-03 15:45:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:30,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:45:30,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:45:30,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:30,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:45:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552025098] [2025-03-03 15:45:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552025098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175342662] [2025-03-03 15:45:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:30,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:30,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:30,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:30,877 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)