./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+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 fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:56:40,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:56:40,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:56:40,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:56:40,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:56:40,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:56:40,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:56:40,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:56:40,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:56:40,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:56:40,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:56:40,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:56:40,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:56:40,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:56:40,147 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:56:40,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:56:40,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:56:40,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:56:40,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:56:40,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:56:40,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:56:40,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:56:40,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:56:40,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:56:40,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:56:40,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:56:40,150 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 -> fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 [2025-03-08 06:56:40,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:56:40,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:56:40,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:56:40,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:56:40,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:56:40,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2025-03-08 06:56:41,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c40009a/a7c23ee5fa29438394d525dbb6554564/FLAG2f0fb6fe3 [2025-03-08 06:56:42,170 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:56:42,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2025-03-08 06:56:42,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c40009a/a7c23ee5fa29438394d525dbb6554564/FLAG2f0fb6fe3 [2025-03-08 06:56:42,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c40009a/a7c23ee5fa29438394d525dbb6554564 [2025-03-08 06:56:42,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:56:42,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:56:42,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:56:42,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:56:42,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:56:42,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:56:42" (1/1) ... [2025-03-08 06:56:42,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa3824e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:42, skipping insertion in model container [2025-03-08 06:56:42,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:56:42" (1/1) ... [2025-03-08 06:56:42,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:56:43,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[382357,382370] [2025-03-08 06:56:43,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[383339,383352] [2025-03-08 06:56:44,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:56:44,041 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:56:44,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[382357,382370] [2025-03-08 06:56:44,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[383339,383352] [2025-03-08 06:56:44,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:56:44,641 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:56:44,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44 WrapperNode [2025-03-08 06:56:44,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:56:44,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:56:44,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:56:44,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:56:44,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:44,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:44,981 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-03-08 06:56:44,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:56:44,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:56:44,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:56:44,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:56:44,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:44,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,215 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:56:45,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:56:45,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:56:45,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:56:45,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:56:45,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (1/1) ... [2025-03-08 06:56:45,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:56:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:45,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:56:45,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:56:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:56:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:56:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:56:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:56:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:56:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:56:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:56:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:56:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:56:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:56:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:56:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:56:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:56:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:56:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:56:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:56:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:56:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:56:45,657 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:56:45,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:56:51,839 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:56:51,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:56:51,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:56:51,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:56:51,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:56:51,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:56:51,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:56:52,036 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2025-03-08 06:56:52,036 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:56:52,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:56:52,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:56:52,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:56:52 BoogieIcfgContainer [2025-03-08 06:56:52,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:56:52,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:56:52,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:56:52,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:56:52,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:56:42" (1/3) ... [2025-03-08 06:56:52,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f47e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:56:52, skipping insertion in model container [2025-03-08 06:56:52,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:44" (2/3) ... [2025-03-08 06:56:52,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f47e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:56:52, skipping insertion in model container [2025-03-08 06:56:52,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:56:52" (3/3) ... [2025-03-08 06:56:52,099 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.08.cil-2.c [2025-03-08 06:56:52,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:56:52,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.08.cil-2.c that has 8 procedures, 2471 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-08 06:56:52,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:56:52,279 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;@33fa4dae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:56:52,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:56:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 2471 states, 2438 states have (on average 1.843724364232978) internal successors, (4495), 2442 states have internal predecessors, (4495), 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-08 06:56:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:52,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:52,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:52,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:52,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1325106512, now seen corresponding path program 1 times [2025-03-08 06:56:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934040749] [2025-03-08 06:56:52,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:52,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:52,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:52,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:52,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:52,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934040749] [2025-03-08 06:56:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934040749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:52,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181444128] [2025-03-08 06:56:52,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:52,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:52,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:52,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:52,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:52,764 INFO L87 Difference]: Start difference. First operand has 2471 states, 2438 states have (on average 1.843724364232978) internal successors, (4495), 2442 states have internal predecessors, (4495), 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 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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-08 06:56:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:53,378 INFO L93 Difference]: Finished difference Result 5226 states and 9555 transitions. [2025-03-08 06:56:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:56:53,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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 133 [2025-03-08 06:56:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:53,407 INFO L225 Difference]: With dead ends: 5226 [2025-03-08 06:56:53,407 INFO L226 Difference]: Without dead ends: 2701 [2025-03-08 06:56:53,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:53,419 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 4848 mSDsluCounter, 8928 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 13299 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:53,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 13299 Invalid, 525 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:56:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-08 06:56:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2678. [2025-03-08 06:56:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2622 states have (on average 1.8127383676582762) internal successors, (4753), 2626 states have internal predecessors, (4753), 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-08 06:56:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 4834 transitions. [2025-03-08 06:56:53,541 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 4834 transitions. Word has length 133 [2025-03-08 06:56:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:53,542 INFO L471 AbstractCegarLoop]: Abstraction has 2678 states and 4834 transitions. [2025-03-08 06:56:53,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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-08 06:56:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 4834 transitions. [2025-03-08 06:56:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:53,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:53,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:53,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:56:53,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:53,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -521346770, now seen corresponding path program 1 times [2025-03-08 06:56:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801690481] [2025-03-08 06:56:53,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:53,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:53,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:53,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:53,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:53,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801690481] [2025-03-08 06:56:53,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801690481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:53,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73631893] [2025-03-08 06:56:53,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:53,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:53,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:53,743 INFO L87 Difference]: Start difference. First operand 2678 states and 4834 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:54,051 INFO L93 Difference]: Finished difference Result 3273 states and 5789 transitions. [2025-03-08 06:56:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:54,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:56:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:54,062 INFO L225 Difference]: With dead ends: 3273 [2025-03-08 06:56:54,063 INFO L226 Difference]: Without dead ends: 2732 [2025-03-08 06:56:54,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:54,066 INFO L435 NwaCegarLoop]: 4290 mSDtfsCounter, 4546 mSDsluCounter, 8461 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 12751 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:54,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 12751 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:56:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-03-08 06:56:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2678. [2025-03-08 06:56:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2622 states have (on average 1.8119755911517925) internal successors, (4751), 2626 states have internal predecessors, (4751), 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-08 06:56:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 4832 transitions. [2025-03-08 06:56:54,130 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 4832 transitions. Word has length 133 [2025-03-08 06:56:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:54,130 INFO L471 AbstractCegarLoop]: Abstraction has 2678 states and 4832 transitions. [2025-03-08 06:56:54,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 4832 transitions. [2025-03-08 06:56:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:54,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:54,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:54,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:56:54,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1805257937, now seen corresponding path program 1 times [2025-03-08 06:56:54,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:54,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70492355] [2025-03-08 06:56:54,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:54,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:54,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:54,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:54,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:54,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:54,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70492355] [2025-03-08 06:56:54,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70492355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:54,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:54,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:54,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775868416] [2025-03-08 06:56:54,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:54,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:54,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:54,307 INFO L87 Difference]: Start difference. First operand 2678 states and 4832 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:54,951 INFO L93 Difference]: Finished difference Result 3565 states and 6244 transitions. [2025-03-08 06:56:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:54,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:56:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:54,965 INFO L225 Difference]: With dead ends: 3565 [2025-03-08 06:56:54,966 INFO L226 Difference]: Without dead ends: 3024 [2025-03-08 06:56:54,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:54,970 INFO L435 NwaCegarLoop]: 4530 mSDtfsCounter, 4774 mSDsluCounter, 13608 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 18138 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:54,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 18138 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:56:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2025-03-08 06:56:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 2933. [2025-03-08 06:56:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2853 states have (on average 1.7910970907816333) internal successors, (5110), 2858 states have internal predecessors, (5110), 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-08 06:56:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 5228 transitions. [2025-03-08 06:56:55,050 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 5228 transitions. Word has length 133 [2025-03-08 06:56:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:55,050 INFO L471 AbstractCegarLoop]: Abstraction has 2933 states and 5228 transitions. [2025-03-08 06:56:55,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 5228 transitions. [2025-03-08 06:56:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:55,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:55,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:55,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:56:55,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:55,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:55,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1569579762, now seen corresponding path program 1 times [2025-03-08 06:56:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:55,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997082293] [2025-03-08 06:56:55,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:55,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:55,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:55,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:55,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997082293] [2025-03-08 06:56:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997082293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437010948] [2025-03-08 06:56:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:55,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:55,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:55,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:55,217 INFO L87 Difference]: Start difference. First operand 2933 states and 5228 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:55,771 INFO L93 Difference]: Finished difference Result 4373 states and 7517 transitions. [2025-03-08 06:56:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:56:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:55,784 INFO L225 Difference]: With dead ends: 4373 [2025-03-08 06:56:55,785 INFO L226 Difference]: Without dead ends: 3577 [2025-03-08 06:56:55,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:55,788 INFO L435 NwaCegarLoop]: 4526 mSDtfsCounter, 4769 mSDsluCounter, 13596 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4785 SdHoareTripleChecker+Valid, 18122 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:55,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4785 Valid, 18122 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:56:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2025-03-08 06:56:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3474. [2025-03-08 06:56:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3344 states have (on average 1.7592703349282297) internal successors, (5883), 3353 states have internal predecessors, (5883), 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-08 06:56:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6081 transitions. [2025-03-08 06:56:55,875 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6081 transitions. Word has length 133 [2025-03-08 06:56:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:55,875 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6081 transitions. [2025-03-08 06:56:55,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6081 transitions. [2025-03-08 06:56:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:55,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:55,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:55,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:56:55,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:55,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1901706063, now seen corresponding path program 1 times [2025-03-08 06:56:55,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:55,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459647479] [2025-03-08 06:56:55,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:55,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:55,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:55,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:55,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459647479] [2025-03-08 06:56:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459647479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:56,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66210705] [2025-03-08 06:56:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:56,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:56,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:56,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:56,123 INFO L87 Difference]: Start difference. First operand 3474 states and 6081 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:56,754 INFO L93 Difference]: Finished difference Result 6108 states and 10304 transitions. [2025-03-08 06:56:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:56,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:56:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:56,772 INFO L225 Difference]: With dead ends: 6108 [2025-03-08 06:56:56,772 INFO L226 Difference]: Without dead ends: 4771 [2025-03-08 06:56:56,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:56,778 INFO L435 NwaCegarLoop]: 4322 mSDtfsCounter, 4791 mSDsluCounter, 13113 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4807 SdHoareTripleChecker+Valid, 17435 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:56,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4807 Valid, 17435 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:56:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2025-03-08 06:56:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4643. [2025-03-08 06:56:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 4407 states have (on average 1.7206716587247561) internal successors, (7583), 4430 states have internal predecessors, (7583), 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-08 06:56:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 7965 transitions. [2025-03-08 06:56:56,892 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 7965 transitions. Word has length 133 [2025-03-08 06:56:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:56,892 INFO L471 AbstractCegarLoop]: Abstraction has 4643 states and 7965 transitions. [2025-03-08 06:56:56,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 7965 transitions. [2025-03-08 06:56:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:56,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:56,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:56:56,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:56,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1311452946, now seen corresponding path program 1 times [2025-03-08 06:56:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:56,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667398755] [2025-03-08 06:56:56,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:56,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:56,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:56,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:56,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667398755] [2025-03-08 06:56:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667398755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675709986] [2025-03-08 06:56:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:57,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:57,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:57,012 INFO L87 Difference]: Start difference. First operand 4643 states and 7965 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:57,722 INFO L93 Difference]: Finished difference Result 9907 states and 16578 transitions. [2025-03-08 06:56:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:56:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:57,748 INFO L225 Difference]: With dead ends: 9907 [2025-03-08 06:56:57,749 INFO L226 Difference]: Without dead ends: 7401 [2025-03-08 06:56:57,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:57,756 INFO L435 NwaCegarLoop]: 4520 mSDtfsCounter, 4759 mSDsluCounter, 13578 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4775 SdHoareTripleChecker+Valid, 18098 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:57,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4775 Valid, 18098 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:56:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7401 states. [2025-03-08 06:56:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7401 to 7224. [2025-03-08 06:56:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7224 states, 6758 states have (on average 1.6885173128144422) internal successors, (11411), 6827 states have internal predecessors, (11411), 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-08 06:56:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 12257 transitions. [2025-03-08 06:56:57,938 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 12257 transitions. Word has length 133 [2025-03-08 06:56:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:57,938 INFO L471 AbstractCegarLoop]: Abstraction has 7224 states and 12257 transitions. [2025-03-08 06:56:57,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 12257 transitions. [2025-03-08 06:56:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:57,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:57,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:57,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:56:57,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:57,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1830745233, now seen corresponding path program 1 times [2025-03-08 06:56:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:57,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310683820] [2025-03-08 06:56:57,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:57,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:57,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:57,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:57,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:57,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310683820] [2025-03-08 06:56:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310683820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:58,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689490349] [2025-03-08 06:56:58,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:58,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:58,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:58,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:58,050 INFO L87 Difference]: Start difference. First operand 7224 states and 12257 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:58,854 INFO L93 Difference]: Finished difference Result 18418 states and 31204 transitions. [2025-03-08 06:56:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:56:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:58,908 INFO L225 Difference]: With dead ends: 18418 [2025-03-08 06:56:58,908 INFO L226 Difference]: Without dead ends: 13331 [2025-03-08 06:56:58,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:58,929 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 4754 mSDsluCounter, 13569 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 18086 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:58,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 18086 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:56:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13331 states. [2025-03-08 06:56:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13331 to 13061. [2025-03-08 06:56:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13061 states, 12081 states have (on average 1.675937422398808) internal successors, (20247), 12296 states have internal predecessors, (20247), 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-08 06:56:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13061 states to 13061 states and 22405 transitions. [2025-03-08 06:56:59,750 INFO L78 Accepts]: Start accepts. Automaton has 13061 states and 22405 transitions. Word has length 133 [2025-03-08 06:56:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:59,750 INFO L471 AbstractCegarLoop]: Abstraction has 13061 states and 22405 transitions. [2025-03-08 06:56:59,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:56:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 13061 states and 22405 transitions. [2025-03-08 06:56:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:56:59,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:59,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:59,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:56:59,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:59,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1477639374, now seen corresponding path program 1 times [2025-03-08 06:56:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:59,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246809935] [2025-03-08 06:56:59,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:59,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:59,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:56:59,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:56:59,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:59,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:59,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:59,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246809935] [2025-03-08 06:56:59,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246809935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:59,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285154295] [2025-03-08 06:56:59,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:59,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:59,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:59,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:59,875 INFO L87 Difference]: Start difference. First operand 13061 states and 22405 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:00,536 INFO L93 Difference]: Finished difference Result 26925 states and 47062 transitions. [2025-03-08 06:57:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:00,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:57:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:00,617 INFO L225 Difference]: With dead ends: 26925 [2025-03-08 06:57:00,617 INFO L226 Difference]: Without dead ends: 16001 [2025-03-08 06:57:00,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:00,659 INFO L435 NwaCegarLoop]: 4277 mSDtfsCounter, 4538 mSDsluCounter, 8436 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4554 SdHoareTripleChecker+Valid, 12713 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:00,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4554 Valid, 12713 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:57:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16001 states. [2025-03-08 06:57:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16001 to 13061. [2025-03-08 06:57:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13061 states, 12081 states have (on average 1.6732058604420164) internal successors, (20214), 12296 states have internal predecessors, (20214), 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-08 06:57:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13061 states to 13061 states and 22372 transitions. [2025-03-08 06:57:01,170 INFO L78 Accepts]: Start accepts. Automaton has 13061 states and 22372 transitions. Word has length 133 [2025-03-08 06:57:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:01,170 INFO L471 AbstractCegarLoop]: Abstraction has 13061 states and 22372 transitions. [2025-03-08 06:57:01,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 13061 states and 22372 transitions. [2025-03-08 06:57:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:57:01,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:01,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:01,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:57:01,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:01,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1740774513, now seen corresponding path program 1 times [2025-03-08 06:57:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471034649] [2025-03-08 06:57:01,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:01,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:57:01,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:57:01,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:01,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:57:01,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:01,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471034649] [2025-03-08 06:57:01,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471034649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:01,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:01,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:01,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886081494] [2025-03-08 06:57:01,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:01,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:01,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:01,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:01,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:01,267 INFO L87 Difference]: Start difference. First operand 13061 states and 22372 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:01,884 INFO L93 Difference]: Finished difference Result 26680 states and 46506 transitions. [2025-03-08 06:57:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:57:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:01,933 INFO L225 Difference]: With dead ends: 26680 [2025-03-08 06:57:01,933 INFO L226 Difference]: Without dead ends: 15756 [2025-03-08 06:57:01,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:01,963 INFO L435 NwaCegarLoop]: 4274 mSDtfsCounter, 4535 mSDsluCounter, 8431 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4551 SdHoareTripleChecker+Valid, 12705 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:01,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4551 Valid, 12705 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:57:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15756 states. [2025-03-08 06:57:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15756 to 13061. [2025-03-08 06:57:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13061 states, 12081 states have (on average 1.6704742984852248) internal successors, (20181), 12296 states have internal predecessors, (20181), 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-08 06:57:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13061 states to 13061 states and 22339 transitions. [2025-03-08 06:57:02,553 INFO L78 Accepts]: Start accepts. Automaton has 13061 states and 22339 transitions. Word has length 133 [2025-03-08 06:57:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:02,554 INFO L471 AbstractCegarLoop]: Abstraction has 13061 states and 22339 transitions. [2025-03-08 06:57:02,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 13061 states and 22339 transitions. [2025-03-08 06:57:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:57:02,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:02,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:02,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:57:02,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:02,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 95068334, now seen corresponding path program 1 times [2025-03-08 06:57:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:02,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017007444] [2025-03-08 06:57:02,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:02,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:57:02,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:57:02,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:57:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017007444] [2025-03-08 06:57:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017007444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:02,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:57:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987473949] [2025-03-08 06:57:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:02,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:57:02,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:02,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:57:02,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:02,734 INFO L87 Difference]: Start difference. First operand 13061 states and 22339 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:04,097 INFO L93 Difference]: Finished difference Result 39361 states and 68421 transitions. [2025-03-08 06:57:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:57:04,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:57:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:04,199 INFO L225 Difference]: With dead ends: 39361 [2025-03-08 06:57:04,199 INFO L226 Difference]: Without dead ends: 28437 [2025-03-08 06:57:04,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:57:04,233 INFO L435 NwaCegarLoop]: 4502 mSDtfsCounter, 4987 mSDsluCounter, 13521 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5012 SdHoareTripleChecker+Valid, 18023 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:04,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5012 Valid, 18023 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:57:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28437 states. [2025-03-08 06:57:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28437 to 26016. [2025-03-08 06:57:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26016 states, 23878 states have (on average 1.6742189463104113) internal successors, (39977), 24547 states have internal predecessors, (39977), 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-08 06:57:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26016 states to 26016 states and 46231 transitions. [2025-03-08 06:57:05,141 INFO L78 Accepts]: Start accepts. Automaton has 26016 states and 46231 transitions. Word has length 133 [2025-03-08 06:57:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:05,142 INFO L471 AbstractCegarLoop]: Abstraction has 26016 states and 46231 transitions. [2025-03-08 06:57:05,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 26016 states and 46231 transitions. [2025-03-08 06:57:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:57:05,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:05,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:05,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:57:05,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:05,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:05,154 INFO L85 PathProgramCache]: Analyzing trace with hash 154289071, now seen corresponding path program 1 times [2025-03-08 06:57:05,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:05,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601776803] [2025-03-08 06:57:05,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:05,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:57:05,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:57:05,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:05,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:57:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601776803] [2025-03-08 06:57:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601776803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468190018] [2025-03-08 06:57:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:05,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:05,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:05,239 INFO L87 Difference]: Start difference. First operand 26016 states and 46231 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:06,393 INFO L93 Difference]: Finished difference Result 56474 states and 103670 transitions. [2025-03-08 06:57:06,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:06,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:57:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:06,514 INFO L225 Difference]: With dead ends: 56474 [2025-03-08 06:57:06,515 INFO L226 Difference]: Without dead ends: 32595 [2025-03-08 06:57:06,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:06,565 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4529 mSDsluCounter, 8420 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 12689 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:06,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4545 Valid, 12689 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:57:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32595 states. [2025-03-08 06:57:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32595 to 26016. [2025-03-08 06:57:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26016 states, 23878 states have (on average 1.671496775274311) internal successors, (39912), 24547 states have internal predecessors, (39912), 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-08 06:57:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26016 states to 26016 states and 46166 transitions. [2025-03-08 06:57:07,995 INFO L78 Accepts]: Start accepts. Automaton has 26016 states and 46166 transitions. Word has length 133 [2025-03-08 06:57:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:07,995 INFO L471 AbstractCegarLoop]: Abstraction has 26016 states and 46166 transitions. [2025-03-08 06:57:07,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26016 states and 46166 transitions. [2025-03-08 06:57:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:57:08,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:08,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:08,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:57:08,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:08,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash 848936078, now seen corresponding path program 1 times [2025-03-08 06:57:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:08,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027848860] [2025-03-08 06:57:08,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:08,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:57:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:57:08,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:08,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:57:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027848860] [2025-03-08 06:57:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027848860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:57:08,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374546465] [2025-03-08 06:57:08,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:08,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:57:08,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:08,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:57:08,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:08,176 INFO L87 Difference]: Start difference. First operand 26016 states and 46166 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:10,455 INFO L93 Difference]: Finished difference Result 82870 states and 153396 transitions. [2025-03-08 06:57:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:57:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:57:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:10,686 INFO L225 Difference]: With dead ends: 82870 [2025-03-08 06:57:10,686 INFO L226 Difference]: Without dead ends: 58991 [2025-03-08 06:57:10,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:57:10,755 INFO L435 NwaCegarLoop]: 4494 mSDtfsCounter, 4914 mSDsluCounter, 13498 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4939 SdHoareTripleChecker+Valid, 17992 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:10,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4939 Valid, 17992 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:57:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58991 states. [2025-03-08 06:57:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58991 to 55232. [2025-03-08 06:57:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55232 states, 50324 states have (on average 1.6828948414275495) internal successors, (84690), 52387 states have internal predecessors, (84690), 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-08 06:57:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55232 states to 55232 states and 105216 transitions. [2025-03-08 06:57:13,518 INFO L78 Accepts]: Start accepts. Automaton has 55232 states and 105216 transitions. Word has length 133 [2025-03-08 06:57:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:13,518 INFO L471 AbstractCegarLoop]: Abstraction has 55232 states and 105216 transitions. [2025-03-08 06:57:13,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 55232 states and 105216 transitions. [2025-03-08 06:57:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:57:13,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:13,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:13,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:57:13,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:13,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:13,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1979722703, now seen corresponding path program 1 times [2025-03-08 06:57:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573320980] [2025-03-08 06:57:13,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:13,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:57:13,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:57:13,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:13,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:57:13,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:13,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573320980] [2025-03-08 06:57:13,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573320980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:13,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:13,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056532302] [2025-03-08 06:57:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:13,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:13,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:13,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:13,631 INFO L87 Difference]: Start difference. First operand 55232 states and 105216 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:16,683 INFO L93 Difference]: Finished difference Result 123650 states and 247170 transitions. [2025-03-08 06:57:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:16,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:57:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:16,977 INFO L225 Difference]: With dead ends: 123650 [2025-03-08 06:57:16,977 INFO L226 Difference]: Without dead ends: 70555 [2025-03-08 06:57:17,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:17,116 INFO L435 NwaCegarLoop]: 4251 mSDtfsCounter, 4536 mSDsluCounter, 8398 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4552 SdHoareTripleChecker+Valid, 12649 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:17,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4552 Valid, 12649 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:57:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70555 states. [2025-03-08 06:57:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70555 to 55232. [2025-03-08 06:57:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55232 states, 50324 states have (on average 1.68033145218981) internal successors, (84561), 52387 states have internal predecessors, (84561), 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-08 06:57:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55232 states to 55232 states and 105087 transitions. [2025-03-08 06:57:20,763 INFO L78 Accepts]: Start accepts. Automaton has 55232 states and 105087 transitions. Word has length 133 [2025-03-08 06:57:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 55232 states and 105087 transitions. [2025-03-08 06:57:20,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 55232 states and 105087 transitions. [2025-03-08 06:57:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:57:20,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:57:20,778 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1046368366, now seen corresponding path program 1 times [2025-03-08 06:57:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465864254] [2025-03-08 06:57:20,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:20,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:57:20,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:57:20,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:20,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:57:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465864254] [2025-03-08 06:57:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465864254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:20,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707009510] [2025-03-08 06:57:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:20,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:20,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:20,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:20,854 INFO L87 Difference]: Start difference. First operand 55232 states and 105087 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:23,758 INFO L93 Difference]: Finished difference Result 121461 states and 242534 transitions. [2025-03-08 06:57:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 06:57:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:24,121 INFO L225 Difference]: With dead ends: 121461 [2025-03-08 06:57:24,121 INFO L226 Difference]: Without dead ends: 68366 [2025-03-08 06:57:24,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:24,291 INFO L435 NwaCegarLoop]: 4261 mSDtfsCounter, 4522 mSDsluCounter, 8406 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4538 SdHoareTripleChecker+Valid, 12667 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:24,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4538 Valid, 12667 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:57:24,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68366 states. [2025-03-08 06:57:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68366 to 55232. [2025-03-08 06:57:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55232 states, 50324 states have (on average 1.6777680629520706) internal successors, (84432), 52387 states have internal predecessors, (84432), 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-08 06:57:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55232 states to 55232 states and 104958 transitions. [2025-03-08 06:57:27,878 INFO L78 Accepts]: Start accepts. Automaton has 55232 states and 104958 transitions. Word has length 133 [2025-03-08 06:57:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:27,878 INFO L471 AbstractCegarLoop]: Abstraction has 55232 states and 104958 transitions. [2025-03-08 06:57:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-08 06:57:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 55232 states and 104958 transitions. [2025-03-08 06:57:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:57:27,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:27,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:27,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:57:27,897 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:27,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:27,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1754686481, now seen corresponding path program 1 times [2025-03-08 06:57:27,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:27,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847082205] [2025-03-08 06:57:27,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:27,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:57:27,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:57:27,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:27,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:57:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847082205] [2025-03-08 06:57:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847082205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:28,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:57:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394945786] [2025-03-08 06:57:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:28,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:57:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:28,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:57:28,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:28,012 INFO L87 Difference]: Start difference. First operand 55232 states and 104958 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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)