./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.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 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:59:27,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:59:27,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:59:27,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:59:27,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:59:27,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:59:27,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:59:27,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:59:27,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:59:27,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:59:27,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:59:27,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:59:27,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:59:27,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:59:27,727 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:59:27,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:59:27,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:59:27,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:59:27,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:59:27,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:59:27,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:59:27,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:59:27,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:59:27,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:59:27,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:59:27,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:59:27,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:59:27,730 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 -> 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 [2025-03-16 19:59:27,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:59:27,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:59:27,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:59:27,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:59:27,978 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:59:27,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2025-03-16 19:59:29,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99f0d82e/65421f84d12a41ed807ea8b01569a03d/FLAG84ceaf45d [2025-03-16 19:59:29,736 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:59:29,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2025-03-16 19:59:29,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99f0d82e/65421f84d12a41ed807ea8b01569a03d/FLAG84ceaf45d [2025-03-16 19:59:30,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99f0d82e/65421f84d12a41ed807ea8b01569a03d [2025-03-16 19:59:30,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:59:30,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:59:30,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:59:30,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:59:30,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:59:30,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:59:30" (1/1) ... [2025-03-16 19:59:30,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ede4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:30, skipping insertion in model container [2025-03-16 19:59:30,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:59:30" (1/1) ... [2025-03-16 19:59:30,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:59:31,550 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_label43+token_ring.08.cil-2.c[381679,381692] [2025-03-16 19:59:31,580 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_label43+token_ring.08.cil-2.c[383339,383352] [2025-03-16 19:59:31,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:59:31,780 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:59:32,270 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_label43+token_ring.08.cil-2.c[381679,381692] [2025-03-16 19:59:32,274 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_label43+token_ring.08.cil-2.c[383339,383352] [2025-03-16 19:59:32,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:59:32,337 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:59:32,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32 WrapperNode [2025-03-16 19:59:32,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:59:32,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:59:32,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:59:32,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:59:32,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:32,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:32,715 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-03-16 19:59:32,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:59:32,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:59:32,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:59:32,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:59:32,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:32,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:32,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:32,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:59:32,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:32,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:33,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:33,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:33,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:33,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:33,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:59:33,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:59:33,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:59:33,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:59:33,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (1/1) ... [2025-03-16 19:59:33,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:59:33,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:33,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:59:33,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:59:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:59:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:59:33,264 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:59:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:59:33,264 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:59:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:59:33,264 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:59:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 19:59:33,265 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 19:59:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:59:33,265 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:59:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:59:33,266 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:59:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:59:33,266 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:59:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:59:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:59:33,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:59:33,360 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:59:33,362 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:59:39,297 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:59:39,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:59:39,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:59:39,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:59:39,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:59:39,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:59:39,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:59:39,597 INFO L? ?]: Removed 1724 outVars from TransFormulas that were not future-live. [2025-03-16 19:59:39,597 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:59:39,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:59:39,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:59:39,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:59:39 BoogieIcfgContainer [2025-03-16 19:59:39,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:59:39,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:59:39,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:59:39,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:59:39,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:59:30" (1/3) ... [2025-03-16 19:59:39,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2107b5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:59:39, skipping insertion in model container [2025-03-16 19:59:39,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:32" (2/3) ... [2025-03-16 19:59:39,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2107b5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:59:39, skipping insertion in model container [2025-03-16 19:59:39,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:59:39" (3/3) ... [2025-03-16 19:59:39,662 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.08.cil-2.c [2025-03-16 19:59:39,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:59:39,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.08.cil-2.c that has 8 procedures, 2397 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-16 19:59:39,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:59:39,776 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;@4fcbab01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:59:39,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:59:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 2397 states, 2364 states have (on average 1.870135363790186) internal successors, (4421), 2368 states have internal predecessors, (4421), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 19:59:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:39,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:39,800 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] [2025-03-16 19:59:39,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash 798441018, now seen corresponding path program 1 times [2025-03-16 19:59:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681499022] [2025-03-16 19:59:39,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:39,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:39,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:39,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:39,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:40,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:40,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681499022] [2025-03-16 19:59:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681499022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:40,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:59:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948911278] [2025-03-16 19:59:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:40,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:40,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:40,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:40,139 INFO L87 Difference]: Start difference. First operand has 2397 states, 2364 states have (on average 1.870135363790186) internal successors, (4421), 2368 states have internal predecessors, (4421), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:40,306 INFO L93 Difference]: Finished difference Result 4789 states and 8929 transitions. [2025-03-16 19:59:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:40,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-03-16 19:59:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:40,334 INFO L225 Difference]: With dead ends: 4789 [2025-03-16 19:59:40,335 INFO L226 Difference]: Without dead ends: 2390 [2025-03-16 19:59:40,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:40,342 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 427 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 8353 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:40,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 8353 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2025-03-16 19:59:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2025-03-16 19:59:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2358 states have (on average 1.8401187446988974) internal successors, (4339), 2361 states have internal predecessors, (4339), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:59:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 4385 transitions. [2025-03-16 19:59:40,461 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 4385 transitions. Word has length 122 [2025-03-16 19:59:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:40,462 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 4385 transitions. [2025-03-16 19:59:40,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 4385 transitions. [2025-03-16 19:59:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:40,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:40,466 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] [2025-03-16 19:59:40,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:59:40,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:40,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1981458553, now seen corresponding path program 1 times [2025-03-16 19:59:40,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:40,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498172344] [2025-03-16 19:59:40,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:40,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:40,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:40,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:40,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498172344] [2025-03-16 19:59:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498172344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:40,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25433653] [2025-03-16 19:59:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:40,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:40,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:40,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:40,704 INFO L87 Difference]: Start difference. First operand 2390 states and 4385 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:41,196 INFO L93 Difference]: Finished difference Result 2933 states and 5258 transitions. [2025-03-16 19:59:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:59:41,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:41,211 INFO L225 Difference]: With dead ends: 2933 [2025-03-16 19:59:41,211 INFO L226 Difference]: Without dead ends: 2678 [2025-03-16 19:59:41,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:41,214 INFO L435 NwaCegarLoop]: 4295 mSDtfsCounter, 4752 mSDsluCounter, 8769 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 13064 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:41,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 13064 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-03-16 19:59:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2655. [2025-03-16 19:59:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2599 states have (on average 1.819545979222778) internal successors, (4729), 2603 states have internal predecessors, (4729), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:59:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4810 transitions. [2025-03-16 19:59:41,278 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4810 transitions. Word has length 122 [2025-03-16 19:59:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:41,278 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4810 transitions. [2025-03-16 19:59:41,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4810 transitions. [2025-03-16 19:59:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:41,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:41,283 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] [2025-03-16 19:59:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:59:41,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash -303987751, now seen corresponding path program 1 times [2025-03-16 19:59:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:41,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396054626] [2025-03-16 19:59:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:41,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:41,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:41,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:41,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:41,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396054626] [2025-03-16 19:59:41,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396054626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:41,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:41,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383296621] [2025-03-16 19:59:41,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:41,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:41,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:41,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:41,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:41,436 INFO L87 Difference]: Start difference. First operand 2655 states and 4810 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:41,731 INFO L93 Difference]: Finished difference Result 3229 states and 5744 transitions. [2025-03-16 19:59:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:41,741 INFO L225 Difference]: With dead ends: 3229 [2025-03-16 19:59:41,742 INFO L226 Difference]: Without dead ends: 2709 [2025-03-16 19:59:41,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:41,744 INFO L435 NwaCegarLoop]: 4285 mSDtfsCounter, 4525 mSDsluCounter, 8451 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4541 SdHoareTripleChecker+Valid, 12736 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:41,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4541 Valid, 12736 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2025-03-16 19:59:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2655. [2025-03-16 19:59:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2599 states have (on average 1.8187764524817238) internal successors, (4727), 2603 states have internal predecessors, (4727), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:59:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4808 transitions. [2025-03-16 19:59:41,798 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4808 transitions. Word has length 122 [2025-03-16 19:59:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:41,799 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4808 transitions. [2025-03-16 19:59:41,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4808 transitions. [2025-03-16 19:59:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:41,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:41,800 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] [2025-03-16 19:59:41,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:59:41,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:41,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash 390659256, now seen corresponding path program 1 times [2025-03-16 19:59:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347588289] [2025-03-16 19:59:41,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:41,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:41,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:41,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:41,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:41,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347588289] [2025-03-16 19:59:41,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347588289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:41,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331937308] [2025-03-16 19:59:41,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:41,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:41,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:41,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:41,940 INFO L87 Difference]: Start difference. First operand 2655 states and 4808 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:42,498 INFO L93 Difference]: Finished difference Result 3511 states and 6189 transitions. [2025-03-16 19:59:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:42,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:42,511 INFO L225 Difference]: With dead ends: 3511 [2025-03-16 19:59:42,511 INFO L226 Difference]: Without dead ends: 2991 [2025-03-16 19:59:42,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:42,516 INFO L435 NwaCegarLoop]: 4524 mSDtfsCounter, 4745 mSDsluCounter, 13588 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 18112 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:42,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 18112 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2025-03-16 19:59:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2900. [2025-03-16 19:59:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2820 states have (on average 1.8) internal successors, (5076), 2825 states have internal predecessors, (5076), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-16 19:59:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 5194 transitions. [2025-03-16 19:59:42,589 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 5194 transitions. Word has length 122 [2025-03-16 19:59:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:42,589 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 5194 transitions. [2025-03-16 19:59:42,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 5194 transitions. [2025-03-16 19:59:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:42,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:42,593 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] [2025-03-16 19:59:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:59:42,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:42,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1521445881, now seen corresponding path program 1 times [2025-03-16 19:59:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937160436] [2025-03-16 19:59:42,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:42,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:42,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:42,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:42,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:42,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:42,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937160436] [2025-03-16 19:59:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937160436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403840819] [2025-03-16 19:59:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:42,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:42,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:42,799 INFO L87 Difference]: Start difference. First operand 2900 states and 5194 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:43,358 INFO L93 Difference]: Finished difference Result 4289 states and 7432 transitions. [2025-03-16 19:59:43,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:43,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:43,373 INFO L225 Difference]: With dead ends: 4289 [2025-03-16 19:59:43,374 INFO L226 Difference]: Without dead ends: 3524 [2025-03-16 19:59:43,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:43,378 INFO L435 NwaCegarLoop]: 4318 mSDtfsCounter, 4765 mSDsluCounter, 13099 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 17417 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:43,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 17417 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2025-03-16 19:59:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3421. [2025-03-16 19:59:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3291 states have (on average 1.7711941659070192) internal successors, (5829), 3300 states have internal predecessors, (5829), 92 states have call successors, (92), 31 states have call predecessors, (92), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 19:59:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 6027 transitions. [2025-03-16 19:59:43,488 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 6027 transitions. Word has length 122 [2025-03-16 19:59:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:43,488 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 6027 transitions. [2025-03-16 19:59:43,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 6027 transitions. [2025-03-16 19:59:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:43,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:43,490 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] [2025-03-16 19:59:43,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:59:43,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:43,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash 588091544, now seen corresponding path program 1 times [2025-03-16 19:59:43,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:43,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155337540] [2025-03-16 19:59:43,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:43,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:43,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:43,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:43,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:43,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155337540] [2025-03-16 19:59:43,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155337540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:43,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:43,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:43,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961584674] [2025-03-16 19:59:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:43,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:43,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:43,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:43,620 INFO L87 Difference]: Start difference. First operand 3421 states and 6027 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:44,250 INFO L93 Difference]: Finished difference Result 5964 states and 10159 transitions. [2025-03-16 19:59:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:44,268 INFO L225 Difference]: With dead ends: 5964 [2025-03-16 19:59:44,269 INFO L226 Difference]: Without dead ends: 4678 [2025-03-16 19:59:44,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:44,274 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 4735 mSDsluCounter, 13567 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4751 SdHoareTripleChecker+Valid, 18084 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:44,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4751 Valid, 18084 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:59:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2025-03-16 19:59:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4550. [2025-03-16 19:59:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4314 states have (on average 1.7359758924432083) internal successors, (7489), 4337 states have internal predecessors, (7489), 160 states have call successors, (160), 55 states have call predecessors, (160), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-16 19:59:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 7871 transitions. [2025-03-16 19:59:44,406 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 7871 transitions. Word has length 122 [2025-03-16 19:59:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:44,407 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 7871 transitions. [2025-03-16 19:59:44,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 7871 transitions. [2025-03-16 19:59:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:44,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:44,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:44,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:59:44,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:44,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2082003993, now seen corresponding path program 1 times [2025-03-16 19:59:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598980724] [2025-03-16 19:59:44,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:44,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:44,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:44,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:44,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598980724] [2025-03-16 19:59:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598980724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331374053] [2025-03-16 19:59:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:44,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:44,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:44,509 INFO L87 Difference]: Start difference. First operand 4550 states and 7871 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:45,105 INFO L93 Difference]: Finished difference Result 9643 states and 16313 transitions. [2025-03-16 19:59:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:45,133 INFO L225 Difference]: With dead ends: 9643 [2025-03-16 19:59:45,134 INFO L226 Difference]: Without dead ends: 7228 [2025-03-16 19:59:45,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:45,144 INFO L435 NwaCegarLoop]: 4514 mSDtfsCounter, 4730 mSDsluCounter, 13558 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4746 SdHoareTripleChecker+Valid, 18072 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:45,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4746 Valid, 18072 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2025-03-16 19:59:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 7051. [2025-03-16 19:59:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 6585 states have (on average 1.7064540622627182) internal successors, (11237), 6654 states have internal predecessors, (11237), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-16 19:59:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 12083 transitions. [2025-03-16 19:59:45,424 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 12083 transitions. Word has length 122 [2025-03-16 19:59:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:45,424 INFO L471 AbstractCegarLoop]: Abstraction has 7051 states and 12083 transitions. [2025-03-16 19:59:45,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 12083 transitions. [2025-03-16 19:59:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:45,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:45,428 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] [2025-03-16 19:59:45,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:59:45,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:45,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 883268728, now seen corresponding path program 1 times [2025-03-16 19:59:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:45,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065124734] [2025-03-16 19:59:45,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:45,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:45,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:45,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065124734] [2025-03-16 19:59:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065124734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008707726] [2025-03-16 19:59:45,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:45,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:45,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:45,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:45,548 INFO L87 Difference]: Start difference. First operand 7051 states and 12083 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:46,210 INFO L93 Difference]: Finished difference Result 17914 states and 30699 transitions. [2025-03-16 19:59:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:46,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:46,273 INFO L225 Difference]: With dead ends: 17914 [2025-03-16 19:59:46,274 INFO L226 Difference]: Without dead ends: 12998 [2025-03-16 19:59:46,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:46,303 INFO L435 NwaCegarLoop]: 4511 mSDtfsCounter, 4725 mSDsluCounter, 13549 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4741 SdHoareTripleChecker+Valid, 18060 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:46,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4741 Valid, 18060 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12998 states. [2025-03-16 19:59:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12998 to 12728. [2025-03-16 19:59:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6950119169220292) internal successors, (19913), 11963 states have internal predecessors, (19913), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:59:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22071 transitions. [2025-03-16 19:59:46,698 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22071 transitions. Word has length 122 [2025-03-16 19:59:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:46,698 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22071 transitions. [2025-03-16 19:59:46,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22071 transitions. [2025-03-16 19:59:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:46,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:46,706 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] [2025-03-16 19:59:46,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:59:46,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1398789177, now seen corresponding path program 1 times [2025-03-16 19:59:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351576151] [2025-03-16 19:59:46,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:46,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:46,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:46,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:46,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:46,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351576151] [2025-03-16 19:59:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351576151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:46,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:46,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732030913] [2025-03-16 19:59:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:46,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:46,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:46,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:46,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:46,795 INFO L87 Difference]: Start difference. First operand 12728 states and 22071 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:47,318 INFO L93 Difference]: Finished difference Result 26261 states and 46397 transitions. [2025-03-16 19:59:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:47,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:47,367 INFO L225 Difference]: With dead ends: 26261 [2025-03-16 19:59:47,368 INFO L226 Difference]: Without dead ends: 15668 [2025-03-16 19:59:47,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:47,399 INFO L435 NwaCegarLoop]: 4272 mSDtfsCounter, 4517 mSDsluCounter, 8426 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 12698 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:47,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 12698 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15668 states. [2025-03-16 19:59:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15668 to 12728. [2025-03-16 19:59:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6922029281579842) internal successors, (19880), 11963 states have internal predecessors, (19880), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:59:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22038 transitions. [2025-03-16 19:59:47,893 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22038 transitions. Word has length 122 [2025-03-16 19:59:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:47,894 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22038 transitions. [2025-03-16 19:59:47,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22038 transitions. [2025-03-16 19:59:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:47,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:47,898 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] [2025-03-16 19:59:47,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:59:47,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:47,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash 445587544, now seen corresponding path program 1 times [2025-03-16 19:59:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799448112] [2025-03-16 19:59:47,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:47,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:47,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:47,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:47,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:47,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799448112] [2025-03-16 19:59:47,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799448112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:47,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:47,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:47,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172011878] [2025-03-16 19:59:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:47,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:47,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:47,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:47,971 INFO L87 Difference]: Start difference. First operand 12728 states and 22038 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:48,434 INFO L93 Difference]: Finished difference Result 26016 states and 45841 transitions. [2025-03-16 19:59:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:48,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:48,484 INFO L225 Difference]: With dead ends: 26016 [2025-03-16 19:59:48,484 INFO L226 Difference]: Without dead ends: 15423 [2025-03-16 19:59:48,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:48,512 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4514 mSDsluCounter, 8421 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4530 SdHoareTripleChecker+Valid, 12690 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:48,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4530 Valid, 12690 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15423 states. [2025-03-16 19:59:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15423 to 12728. [2025-03-16 19:59:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11748 states have (on average 1.6893939393939394) internal successors, (19847), 11963 states have internal predecessors, (19847), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:59:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 22005 transitions. [2025-03-16 19:59:49,128 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 22005 transitions. Word has length 122 [2025-03-16 19:59:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:49,129 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 22005 transitions. [2025-03-16 19:59:49,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 22005 transitions. [2025-03-16 19:59:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:49,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:49,136 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] [2025-03-16 19:59:49,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:59:49,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1246123097, now seen corresponding path program 1 times [2025-03-16 19:59:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412661608] [2025-03-16 19:59:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:49,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:49,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:49,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:49,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412661608] [2025-03-16 19:59:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412661608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:49,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:49,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:49,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921855057] [2025-03-16 19:59:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:49,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:49,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:49,270 INFO L87 Difference]: Start difference. First operand 12728 states and 22005 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:50,426 INFO L93 Difference]: Finished difference Result 38089 states and 67148 transitions. [2025-03-16 19:59:50,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:50,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:50,521 INFO L225 Difference]: With dead ends: 38089 [2025-03-16 19:59:50,521 INFO L226 Difference]: Without dead ends: 27496 [2025-03-16 19:59:50,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:50,555 INFO L435 NwaCegarLoop]: 4496 mSDtfsCounter, 4931 mSDsluCounter, 13501 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4956 SdHoareTripleChecker+Valid, 17997 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:50,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4956 Valid, 17997 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27496 states. [2025-03-16 19:59:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27496 to 25363. [2025-03-16 19:59:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25363 states, 23225 states have (on average 1.6931324004305706) internal successors, (39323), 23894 states have internal predecessors, (39323), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:59:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25363 states to 25363 states and 45577 transitions. [2025-03-16 19:59:51,433 INFO L78 Accepts]: Start accepts. Automaton has 25363 states and 45577 transitions. Word has length 122 [2025-03-16 19:59:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:51,434 INFO L471 AbstractCegarLoop]: Abstraction has 25363 states and 45577 transitions. [2025-03-16 19:59:51,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25363 states and 45577 transitions. [2025-03-16 19:59:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:51,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:51,444 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] [2025-03-16 19:59:51,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:59:51,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:51,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash 717757496, now seen corresponding path program 1 times [2025-03-16 19:59:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459562377] [2025-03-16 19:59:51,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:51,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:51,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:51,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:51,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459562377] [2025-03-16 19:59:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459562377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:51,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145394704] [2025-03-16 19:59:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:51,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:51,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:51,526 INFO L87 Difference]: Start difference. First operand 25363 states and 45577 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:52,531 INFO L93 Difference]: Finished difference Result 55170 states and 102365 transitions. [2025-03-16 19:59:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:52,647 INFO L225 Difference]: With dead ends: 55170 [2025-03-16 19:59:52,648 INFO L226 Difference]: Without dead ends: 31942 [2025-03-16 19:59:52,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:52,707 INFO L435 NwaCegarLoop]: 4264 mSDtfsCounter, 4508 mSDsluCounter, 8410 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 12674 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:52,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4524 Valid, 12674 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31942 states. [2025-03-16 19:59:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31942 to 25363. [2025-03-16 19:59:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25363 states, 23225 states have (on average 1.6903336921420882) internal successors, (39258), 23894 states have internal predecessors, (39258), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:59:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25363 states to 25363 states and 45512 transitions. [2025-03-16 19:59:53,998 INFO L78 Accepts]: Start accepts. Automaton has 25363 states and 45512 transitions. Word has length 122 [2025-03-16 19:59:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:53,999 INFO L471 AbstractCegarLoop]: Abstraction has 25363 states and 45512 transitions. [2025-03-16 19:59:53,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 25363 states and 45512 transitions. [2025-03-16 19:59:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:54,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:54,011 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] [2025-03-16 19:59:54,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:59:54,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:54,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1393450105, now seen corresponding path program 1 times [2025-03-16 19:59:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:54,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908545227] [2025-03-16 19:59:54,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:54,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:54,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:54,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:54,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:54,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908545227] [2025-03-16 19:59:54,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908545227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:54,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:54,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:54,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911419940] [2025-03-16 19:59:54,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:54,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:54,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:54,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:54,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:54,132 INFO L87 Difference]: Start difference. First operand 25363 states and 45512 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:56,810 INFO L93 Difference]: Finished difference Result 80478 states and 151003 transitions. [2025-03-16 19:59:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 19:59:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:57,050 INFO L225 Difference]: With dead ends: 80478 [2025-03-16 19:59:57,051 INFO L226 Difference]: Without dead ends: 57250 [2025-03-16 19:59:57,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:57,281 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4900 mSDsluCounter, 13033 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 17333 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:57,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 17333 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57250 states. [2025-03-16 19:59:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57250 to 53939. [2025-03-16 19:59:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.7008831147641288) internal successors, (83396), 51094 states have internal predecessors, (83396), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 19:59:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103922 transitions. [2025-03-16 19:59:59,686 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103922 transitions. Word has length 122 [2025-03-16 19:59:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:59,686 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103922 transitions. [2025-03-16 19:59:59,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103922 transitions. [2025-03-16 19:59:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:59:59,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:59,703 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] [2025-03-16 19:59:59,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:59:59,704 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:59,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash 583962648, now seen corresponding path program 1 times [2025-03-16 19:59:59,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:59,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517211494] [2025-03-16 19:59:59,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:59,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:59,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:59:59,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:59:59,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:59,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517211494] [2025-03-16 19:59:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517211494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:59,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:59,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443265879] [2025-03-16 19:59:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:59,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:59,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:59,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:59,785 INFO L87 Difference]: Start difference. First operand 53939 states and 103922 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:02,783 INFO L93 Difference]: Finished difference Result 121066 states and 244585 transitions. [2025-03-16 20:00:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:00:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:00:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:03,268 INFO L225 Difference]: With dead ends: 121066 [2025-03-16 20:00:03,269 INFO L226 Difference]: Without dead ends: 69262 [2025-03-16 20:00:03,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:03,356 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 4504 mSDsluCounter, 8401 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 12660 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:03,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 12660 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:00:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69262 states. [2025-03-16 20:00:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69262 to 53939. [2025-03-16 20:00:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.6982521262058698) internal successors, (83267), 51094 states have internal predecessors, (83267), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:00:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103793 transitions. [2025-03-16 20:00:07,050 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103793 transitions. Word has length 122 [2025-03-16 20:00:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:07,051 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103793 transitions. [2025-03-16 20:00:07,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103793 transitions. [2025-03-16 20:00:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:00:07,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:07,071 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] [2025-03-16 20:00:07,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:00:07,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash 142208153, now seen corresponding path program 1 times [2025-03-16 20:00:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100491030] [2025-03-16 20:00:07,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:07,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:00:07,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:00:07,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:07,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100491030] [2025-03-16 20:00:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100491030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:00:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372087835] [2025-03-16 20:00:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:07,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:00:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:07,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:00:07,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:00:07,146 INFO L87 Difference]: Start difference. First operand 53939 states and 103793 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:10,044 INFO L93 Difference]: Finished difference Result 118877 states and 239949 transitions. [2025-03-16 20:00:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:00:10,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:00:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:10,348 INFO L225 Difference]: With dead ends: 118877 [2025-03-16 20:00:10,348 INFO L226 Difference]: Without dead ends: 67073 [2025-03-16 20:00:10,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:10,489 INFO L435 NwaCegarLoop]: 4256 mSDtfsCounter, 4501 mSDsluCounter, 8396 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 12652 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:10,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 12652 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:00:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67073 states. [2025-03-16 20:00:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67073 to 53939. [2025-03-16 20:00:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53939 states, 49031 states have (on average 1.6956211376476107) internal successors, (83138), 51094 states have internal predecessors, (83138), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 20:00:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53939 states to 53939 states and 103664 transitions. [2025-03-16 20:00:13,610 INFO L78 Accepts]: Start accepts. Automaton has 53939 states and 103664 transitions. Word has length 122 [2025-03-16 20:00:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:13,610 INFO L471 AbstractCegarLoop]: Abstraction has 53939 states and 103664 transitions. [2025-03-16 20:00:13,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 53939 states and 103664 transitions. [2025-03-16 20:00:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:00:13,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:13,625 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] [2025-03-16 20:00:13,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:00:13,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:13,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash 127958008, now seen corresponding path program 1 times [2025-03-16 20:00:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:13,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173095279] [2025-03-16 20:00:13,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:13,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:13,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:00:13,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:00:13,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173095279] [2025-03-16 20:00:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173095279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:13,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:13,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692874971] [2025-03-16 20:00:13,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:13,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:13,705 INFO L87 Difference]: Start difference. First operand 53939 states and 103664 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:18,957 INFO L93 Difference]: Finished difference Result 171684 states and 356713 transitions. [2025-03-16 20:00:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:00:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2025-03-16 20:00:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:19,591 INFO L225 Difference]: With dead ends: 171684 [2025-03-16 20:00:19,591 INFO L226 Difference]: Without dead ends: 119880 [2025-03-16 20:00:19,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:00:19,789 INFO L435 NwaCegarLoop]: 4475 mSDtfsCounter, 4762 mSDsluCounter, 13441 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 17916 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:19,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 17916 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:00:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119880 states. [2025-03-16 20:00:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119880 to 116002. [2025-03-16 20:00:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116002 states, 104160 states have (on average 1.6973694316436252) internal successors, (176798), 110469 states have internal predecessors, (176798), 3992 states have call successors, (3992), 1543 states have call predecessors, (3992), 7848 states have return successors, (69526), 4245 states have call predecessors, (69526), 3990 states have call successors, (69526) [2025-03-16 20:00:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116002 states to 116002 states and 250316 transitions. [2025-03-16 20:00:27,750 INFO L78 Accepts]: Start accepts. Automaton has 116002 states and 250316 transitions. Word has length 122 [2025-03-16 20:00:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:27,750 INFO L471 AbstractCegarLoop]: Abstraction has 116002 states and 250316 transitions. [2025-03-16 20:00:27,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 116002 states and 250316 transitions. [2025-03-16 20:00:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 20:00:27,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:27,778 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] [2025-03-16 20:00:27,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:00:27,778 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:27,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash -842332999, now seen corresponding path program 1 times [2025-03-16 20:00:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140010816] [2025-03-16 20:00:27,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:27,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 20:00:27,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 20:00:27,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:27,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140010816] [2025-03-16 20:00:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140010816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:00:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270645515] [2025-03-16 20:00:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:00:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:00:27,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:00:27,845 INFO L87 Difference]: Start difference. First operand 116002 states and 250316 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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)