./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:15:21,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:15:21,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:15:21,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:15:21,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:15:22,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:15:22,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:15:22,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:15:22,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:15:22,001 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:15:22,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:15:22,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:15:22,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:15:22,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:15:22,001 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:15:22,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:15:22,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:15:22,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:15:22,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:15:22,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:15:22,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:15:22,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:15:22,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:15:22,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:15:22,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:15:22,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:15:22,007 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 [2025-02-05 17:15:22,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:15:22,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:15:22,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:15:22,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:15:22,296 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:15:22,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2025-02-05 17:15:23,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15fd4ca1b/8d731cd51c6a4742a23741cefb858c1f/FLAGf96f48c66 [2025-02-05 17:15:24,084 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:15:24,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2025-02-05 17:15:24,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15fd4ca1b/8d731cd51c6a4742a23741cefb858c1f/FLAGf96f48c66 [2025-02-05 17:15:24,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15fd4ca1b/8d731cd51c6a4742a23741cefb858c1f [2025-02-05 17:15:24,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:15:24,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:15:24,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:15:24,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:15:24,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:15:24,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:15:24" (1/1) ... [2025-02-05 17:15:24,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b75990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:24, skipping insertion in model container [2025-02-05 17:15:24,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:15:24" (1/1) ... [2025-02-05 17:15:24,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:15:25,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[382357,382370] [2025-02-05 17:15:25,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[383339,383352] [2025-02-05 17:15:25,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:15:25,570 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:15:26,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[382357,382370] [2025-02-05 17:15:26,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c[383339,383352] [2025-02-05 17:15:26,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:15:26,295 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:15:26,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26 WrapperNode [2025-02-05 17:15:26,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:15:26,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:15:26,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:15:26,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:15:26,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:26,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:26,815 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-02-05 17:15:26,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:15:26,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:15:26,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:15:26,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:15:26,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:26,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:26,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:26,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:15:26,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:26,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:27,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:27,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:27,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:27,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:27,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:15:27,244 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:15:27,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:15:27,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:15:27,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (1/1) ... [2025-02-05 17:15:27,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:15:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:15:27,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:15:27,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:15:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:15:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:15:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:15:27,304 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:15:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:15:27,304 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:15:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:15:27,304 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:15:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:15:27,304 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:15:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:15:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:15:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:15:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:15:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:15:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:15:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:15:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:15:27,410 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:15:27,412 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:15:34,245 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:15:34,245 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:15:34,246 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:15:34,246 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:15:34,247 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:15:34,247 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:15:34,248 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:15:34,554 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2025-02-05 17:15:34,554 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:15:34,618 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:15:34,618 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:15:34,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:15:34 BoogieIcfgContainer [2025-02-05 17:15:34,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:15:34,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:15:34,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:15:34,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:15:34,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:15:24" (1/3) ... [2025-02-05 17:15:34,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3037906f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:15:34, skipping insertion in model container [2025-02-05 17:15:34,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:15:26" (2/3) ... [2025-02-05 17:15:34,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3037906f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:15:34, skipping insertion in model container [2025-02-05 17:15:34,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:15:34" (3/3) ... [2025-02-05 17:15:34,633 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.08.cil-2.c [2025-02-05 17:15:34,653 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:15:34,657 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.08.cil-2.c that has 8 procedures, 2491 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-02-05 17:15:34,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:15:34,778 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;@575c89d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:15:34,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:15:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 2491 states, 2457 states have (on average 1.8376068376068375) internal successors, (4515), 2462 states have internal predecessors, (4515), 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-02-05 17:15:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:34,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:34,810 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, 1, 1] [2025-02-05 17:15:34,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1770730538, now seen corresponding path program 1 times [2025-02-05 17:15:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563465144] [2025-02-05 17:15:34,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:34,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:34,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:34,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:34,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:35,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563465144] [2025-02-05 17:15:35,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563465144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:35,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:35,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:35,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689071631] [2025-02-05 17:15:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:35,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:35,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:35,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:35,359 INFO L87 Difference]: Start difference. First operand has 2491 states, 2457 states have (on average 1.8376068376068375) internal successors, (4515), 2462 states have internal predecessors, (4515), 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.8) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:36,001 INFO L93 Difference]: Finished difference Result 5286 states and 9615 transitions. [2025-02-05 17:15:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:15:36,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:36,030 INFO L225 Difference]: With dead ends: 5286 [2025-02-05 17:15:36,031 INFO L226 Difference]: Without dead ends: 2741 [2025-02-05 17:15:36,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:36,044 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4868 mSDsluCounter, 8988 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4884 SdHoareTripleChecker+Valid, 13379 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-02-05 17:15:36,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4884 Valid, 13379 Invalid, 525 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2025-02-05 17:15:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2718. [2025-02-05 17:15:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2662 states have (on average 1.8005259203606312) internal successors, (4793), 2666 states have internal predecessors, (4793), 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-02-05 17:15:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 4874 transitions. [2025-02-05 17:15:36,203 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 4874 transitions. Word has length 135 [2025-02-05 17:15:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:36,203 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 4874 transitions. [2025-02-05 17:15:36,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 4874 transitions. [2025-02-05 17:15:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:36,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:36,209 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, 1, 1] [2025-02-05 17:15:36,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:15:36,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:36,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1089729320, now seen corresponding path program 1 times [2025-02-05 17:15:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136936143] [2025-02-05 17:15:36,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:36,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:36,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:36,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:36,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:36,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136936143] [2025-02-05 17:15:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136936143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:36,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:36,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:36,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274989599] [2025-02-05 17:15:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:36,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:36,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:36,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:36,397 INFO L87 Difference]: Start difference. First operand 2718 states and 4874 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:36,798 INFO L93 Difference]: Finished difference Result 3353 states and 5869 transitions. [2025-02-05 17:15:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:36,814 INFO L225 Difference]: With dead ends: 3353 [2025-02-05 17:15:36,814 INFO L226 Difference]: Without dead ends: 2772 [2025-02-05 17:15:36,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:36,817 INFO L435 NwaCegarLoop]: 4310 mSDtfsCounter, 4566 mSDsluCounter, 8501 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 12811 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:36,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 12811 Invalid, 367 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:15:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2025-02-05 17:15:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2718. [2025-02-05 17:15:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2662 states have (on average 1.7997746055597295) internal successors, (4791), 2666 states have internal predecessors, (4791), 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-02-05 17:15:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 4872 transitions. [2025-02-05 17:15:36,894 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 4872 transitions. Word has length 135 [2025-02-05 17:15:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:36,896 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 4872 transitions. [2025-02-05 17:15:36,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 4872 transitions. [2025-02-05 17:15:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:36,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:36,899 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, 1, 1] [2025-02-05 17:15:36,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:15:36,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:36,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash -93288215, now seen corresponding path program 1 times [2025-02-05 17:15:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305897740] [2025-02-05 17:15:36,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:36,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:36,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:36,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:36,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:36,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305897740] [2025-02-05 17:15:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305897740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:37,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:37,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90177515] [2025-02-05 17:15:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:37,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:37,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:37,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:37,141 INFO L87 Difference]: Start difference. First operand 2718 states and 4872 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:37,754 INFO L93 Difference]: Finished difference Result 3665 states and 6344 transitions. [2025-02-05 17:15:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:37,766 INFO L225 Difference]: With dead ends: 3665 [2025-02-05 17:15:37,767 INFO L226 Difference]: Without dead ends: 3084 [2025-02-05 17:15:37,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:15:37,771 INFO L435 NwaCegarLoop]: 4570 mSDtfsCounter, 4794 mSDsluCounter, 13748 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4810 SdHoareTripleChecker+Valid, 18318 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-02-05 17:15:37,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4810 Valid, 18318 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2025-02-05 17:15:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2993. [2025-02-05 17:15:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2913 states have (on average 1.7748026089941642) internal successors, (5170), 2918 states have internal predecessors, (5170), 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-02-05 17:15:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 5288 transitions. [2025-02-05 17:15:37,846 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 5288 transitions. Word has length 135 [2025-02-05 17:15:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:37,846 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 5288 transitions. [2025-02-05 17:15:37,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 5288 transitions. [2025-02-05 17:15:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:37,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:37,848 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, 1, 1] [2025-02-05 17:15:37,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:15:37,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:37,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1239828728, now seen corresponding path program 1 times [2025-02-05 17:15:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373745858] [2025-02-05 17:15:37,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:37,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:37,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:37,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:37,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:38,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373745858] [2025-02-05 17:15:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373745858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435341628] [2025-02-05 17:15:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:38,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:38,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:38,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:38,036 INFO L87 Difference]: Start difference. First operand 2993 states and 5288 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:38,860 INFO L93 Difference]: Finished difference Result 4533 states and 7677 transitions. [2025-02-05 17:15:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:38,877 INFO L225 Difference]: With dead ends: 4533 [2025-02-05 17:15:38,878 INFO L226 Difference]: Without dead ends: 3677 [2025-02-05 17:15:38,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:15:38,882 INFO L435 NwaCegarLoop]: 4566 mSDtfsCounter, 4789 mSDsluCounter, 13736 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4805 SdHoareTripleChecker+Valid, 18302 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:38,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4805 Valid, 18302 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:15:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2025-02-05 17:15:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3574. [2025-02-05 17:15:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3574 states, 3444 states have (on average 1.7372241579558654) internal successors, (5983), 3453 states have internal predecessors, (5983), 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-02-05 17:15:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 6181 transitions. [2025-02-05 17:15:38,982 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 6181 transitions. Word has length 135 [2025-02-05 17:15:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:38,983 INFO L471 AbstractCegarLoop]: Abstraction has 3574 states and 6181 transitions. [2025-02-05 17:15:38,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 6181 transitions. [2025-02-05 17:15:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:38,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:38,988 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, 1, 1] [2025-02-05 17:15:38,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:15:38,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:38,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1771227401, now seen corresponding path program 1 times [2025-02-05 17:15:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:38,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474139066] [2025-02-05 17:15:38,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:39,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:39,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:39,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:39,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:39,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:39,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474139066] [2025-02-05 17:15:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474139066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:39,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109690196] [2025-02-05 17:15:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:39,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:39,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:39,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:39,115 INFO L87 Difference]: Start difference. First operand 3574 states and 6181 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:39,646 INFO L93 Difference]: Finished difference Result 6388 states and 10584 transitions. [2025-02-05 17:15:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:39,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:39,667 INFO L225 Difference]: With dead ends: 6388 [2025-02-05 17:15:39,667 INFO L226 Difference]: Without dead ends: 4951 [2025-02-05 17:15:39,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:15:39,674 INFO L435 NwaCegarLoop]: 4342 mSDtfsCounter, 4811 mSDsluCounter, 13193 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4827 SdHoareTripleChecker+Valid, 17535 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:39,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4827 Valid, 17535 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:15:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2025-02-05 17:15:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4823. [2025-02-05 17:15:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 4587 states have (on average 1.6923915413124047) internal successors, (7763), 4610 states have internal predecessors, (7763), 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-02-05 17:15:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 8145 transitions. [2025-02-05 17:15:39,846 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 8145 transitions. Word has length 135 [2025-02-05 17:15:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:39,846 INFO L471 AbstractCegarLoop]: Abstraction has 4823 states and 8145 transitions. [2025-02-05 17:15:39,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 8145 transitions. [2025-02-05 17:15:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:39,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:39,853 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, 1, 1] [2025-02-05 17:15:39,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:15:39,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2006905576, now seen corresponding path program 1 times [2025-02-05 17:15:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789914186] [2025-02-05 17:15:39,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:39,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:39,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:39,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:39,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:39,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:39,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789914186] [2025-02-05 17:15:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789914186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:39,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:39,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554692019] [2025-02-05 17:15:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:39,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:39,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:39,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:39,981 INFO L87 Difference]: Start difference. First operand 4823 states and 8145 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:40,612 INFO L93 Difference]: Finished difference Result 10427 states and 17098 transitions. [2025-02-05 17:15:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:40,646 INFO L225 Difference]: With dead ends: 10427 [2025-02-05 17:15:40,646 INFO L226 Difference]: Without dead ends: 7741 [2025-02-05 17:15:40,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:15:40,656 INFO L435 NwaCegarLoop]: 4560 mSDtfsCounter, 4779 mSDsluCounter, 13718 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4795 SdHoareTripleChecker+Valid, 18278 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-02-05 17:15:40,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4795 Valid, 18278 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:15:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2025-02-05 17:15:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 7564. [2025-02-05 17:15:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7564 states, 7098 states have (on average 1.6555367709213864) internal successors, (11751), 7167 states have internal predecessors, (11751), 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-02-05 17:15:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 12597 transitions. [2025-02-05 17:15:40,916 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 12597 transitions. Word has length 135 [2025-02-05 17:15:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:40,917 INFO L471 AbstractCegarLoop]: Abstraction has 7564 states and 12597 transitions. [2025-02-05 17:15:40,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 12597 transitions. [2025-02-05 17:15:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:40,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:40,921 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, 1, 1] [2025-02-05 17:15:40,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:15:40,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:40,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:40,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1183224105, now seen corresponding path program 1 times [2025-02-05 17:15:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:40,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986593987] [2025-02-05 17:15:40,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:40,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:40,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:40,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:40,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:40,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:41,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986593987] [2025-02-05 17:15:41,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986593987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:41,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:41,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668246927] [2025-02-05 17:15:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:41,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:41,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:41,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:41,026 INFO L87 Difference]: Start difference. First operand 7564 states and 12597 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:42,063 INFO L93 Difference]: Finished difference Result 19418 states and 32204 transitions. [2025-02-05 17:15:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:42,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:42,121 INFO L225 Difference]: With dead ends: 19418 [2025-02-05 17:15:42,122 INFO L226 Difference]: Without dead ends: 13991 [2025-02-05 17:15:42,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:15:42,142 INFO L435 NwaCegarLoop]: 4557 mSDtfsCounter, 4774 mSDsluCounter, 13709 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 18266 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:42,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 18266 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:15:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13991 states. [2025-02-05 17:15:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13991 to 13721. [2025-02-05 17:15:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13721 states, 12741 states have (on average 1.6409230044737462) internal successors, (20907), 12956 states have internal predecessors, (20907), 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-02-05 17:15:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 23065 transitions. [2025-02-05 17:15:42,595 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 23065 transitions. Word has length 135 [2025-02-05 17:15:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:42,596 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 23065 transitions. [2025-02-05 17:15:42,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 23065 transitions. [2025-02-05 17:15:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:42,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:42,604 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, 1, 1] [2025-02-05 17:15:42,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:15:42,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2029934904, now seen corresponding path program 1 times [2025-02-05 17:15:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692118409] [2025-02-05 17:15:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:42,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:42,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:42,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:42,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692118409] [2025-02-05 17:15:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692118409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366225666] [2025-02-05 17:15:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:42,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:42,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:42,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:42,704 INFO L87 Difference]: Start difference. First operand 13721 states and 23065 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:43,227 INFO L93 Difference]: Finished difference Result 28245 states and 48382 transitions. [2025-02-05 17:15:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:43,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:43,285 INFO L225 Difference]: With dead ends: 28245 [2025-02-05 17:15:43,286 INFO L226 Difference]: Without dead ends: 16661 [2025-02-05 17:15:43,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:43,320 INFO L435 NwaCegarLoop]: 4297 mSDtfsCounter, 4558 mSDsluCounter, 8476 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 12773 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-02-05 17:15:43,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 12773 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:15:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16661 states. [2025-02-05 17:15:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16661 to 13721. [2025-02-05 17:15:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13721 states, 12741 states have (on average 1.6383329408994585) internal successors, (20874), 12956 states have internal predecessors, (20874), 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-02-05 17:15:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 23032 transitions. [2025-02-05 17:15:44,103 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 23032 transitions. Word has length 135 [2025-02-05 17:15:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:44,104 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 23032 transitions. [2025-02-05 17:15:44,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 23032 transitions. [2025-02-05 17:15:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:44,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:44,111 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, 1, 1] [2025-02-05 17:15:44,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:15:44,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:44,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1745740105, now seen corresponding path program 1 times [2025-02-05 17:15:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451282282] [2025-02-05 17:15:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:44,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:44,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:44,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:44,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:44,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:44,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451282282] [2025-02-05 17:15:44,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451282282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:44,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:44,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886821178] [2025-02-05 17:15:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:44,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:44,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:44,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:44,200 INFO L87 Difference]: Start difference. First operand 13721 states and 23032 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:44,804 INFO L93 Difference]: Finished difference Result 28000 states and 47826 transitions. [2025-02-05 17:15:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:44,859 INFO L225 Difference]: With dead ends: 28000 [2025-02-05 17:15:44,859 INFO L226 Difference]: Without dead ends: 16416 [2025-02-05 17:15:44,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:44,893 INFO L435 NwaCegarLoop]: 4294 mSDtfsCounter, 4555 mSDsluCounter, 8471 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4571 SdHoareTripleChecker+Valid, 12765 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-02-05 17:15:44,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4571 Valid, 12765 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:15:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2025-02-05 17:15:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 13721. [2025-02-05 17:15:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13721 states, 12741 states have (on average 1.6357428773251708) internal successors, (20841), 12956 states have internal predecessors, (20841), 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-02-05 17:15:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 22999 transitions. [2025-02-05 17:15:45,414 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 22999 transitions. Word has length 135 [2025-02-05 17:15:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:45,414 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 22999 transitions. [2025-02-05 17:15:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 22999 transitions. [2025-02-05 17:15:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:45,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:45,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:15:45,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:15:45,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash 759157416, now seen corresponding path program 1 times [2025-02-05 17:15:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728061985] [2025-02-05 17:15:45,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:45,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:45,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:45,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:45,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728061985] [2025-02-05 17:15:45,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728061985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:45,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:45,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:45,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686555901] [2025-02-05 17:15:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:45,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:45,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:45,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:45,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:45,527 INFO L87 Difference]: Start difference. First operand 13721 states and 22999 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:47,066 INFO L93 Difference]: Finished difference Result 41321 states and 70381 transitions. [2025-02-05 17:15:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:47,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:47,167 INFO L225 Difference]: With dead ends: 41321 [2025-02-05 17:15:47,168 INFO L226 Difference]: Without dead ends: 29737 [2025-02-05 17:15:47,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:15:47,189 INFO L435 NwaCegarLoop]: 4542 mSDtfsCounter, 5007 mSDsluCounter, 13661 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5032 SdHoareTripleChecker+Valid, 18203 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.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:47,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5032 Valid, 18203 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:15:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29737 states. [2025-02-05 17:15:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29737 to 27316. [2025-02-05 17:15:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27316 states, 25178 states have (on average 1.6394074191754706) internal successors, (41277), 25847 states have internal predecessors, (41277), 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-02-05 17:15:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 47531 transitions. [2025-02-05 17:15:48,589 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 47531 transitions. Word has length 135 [2025-02-05 17:15:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 27316 states and 47531 transitions. [2025-02-05 17:15:48,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 47531 transitions. [2025-02-05 17:15:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:48,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:48,600 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, 1, 1] [2025-02-05 17:15:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:15:48,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1835710825, now seen corresponding path program 1 times [2025-02-05 17:15:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7749160] [2025-02-05 17:15:48,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:48,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:48,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:48,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:48,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7749160] [2025-02-05 17:15:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7749160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984524773] [2025-02-05 17:15:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:48,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:48,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:48,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:48,697 INFO L87 Difference]: Start difference. First operand 27316 states and 47531 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:50,006 INFO L93 Difference]: Finished difference Result 59074 states and 106270 transitions. [2025-02-05 17:15:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:15:50,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:50,131 INFO L225 Difference]: With dead ends: 59074 [2025-02-05 17:15:50,132 INFO L226 Difference]: Without dead ends: 33895 [2025-02-05 17:15:50,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:50,187 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4549 mSDsluCounter, 8460 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4565 SdHoareTripleChecker+Valid, 12749 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:50,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4565 Valid, 12749 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:15:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33895 states. [2025-02-05 17:15:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33895 to 27316. [2025-02-05 17:15:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27316 states, 25178 states have (on average 1.6368258003018508) internal successors, (41212), 25847 states have internal predecessors, (41212), 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-02-05 17:15:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 47466 transitions. [2025-02-05 17:15:51,725 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 47466 transitions. Word has length 135 [2025-02-05 17:15:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:51,726 INFO L471 AbstractCegarLoop]: Abstraction has 27316 states and 47466 transitions. [2025-02-05 17:15:51,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 47466 transitions. [2025-02-05 17:15:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:51,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:51,735 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, 1, 1] [2025-02-05 17:15:51,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:15:51,735 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:51,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash -623413624, now seen corresponding path program 1 times [2025-02-05 17:15:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437439343] [2025-02-05 17:15:51,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:51,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:51,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:51,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437439343] [2025-02-05 17:15:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437439343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:51,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:51,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:15:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271952965] [2025-02-05 17:15:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:51,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:15:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:51,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:15:51,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:15:51,945 INFO L87 Difference]: Start difference. First operand 27316 states and 47466 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:15:54,748 INFO L93 Difference]: Finished difference Result 86750 states and 157276 transitions. [2025-02-05 17:15:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:15:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:15:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:15:55,088 INFO L225 Difference]: With dead ends: 86750 [2025-02-05 17:15:55,088 INFO L226 Difference]: Without dead ends: 61571 [2025-02-05 17:15:55,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:15:55,141 INFO L435 NwaCegarLoop]: 4534 mSDtfsCounter, 4934 mSDsluCounter, 13638 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4959 SdHoareTripleChecker+Valid, 18172 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:15:55,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4959 Valid, 18172 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:15:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61571 states. [2025-02-05 17:15:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61571 to 57812. [2025-02-05 17:15:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57812 states, 52904 states have (on average 1.6495917132920006) internal successors, (87270), 54967 states have internal predecessors, (87270), 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-02-05 17:15:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107796 transitions. [2025-02-05 17:15:58,256 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107796 transitions. Word has length 135 [2025-02-05 17:15:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:15:58,257 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107796 transitions. [2025-02-05 17:15:58,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:15:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107796 transitions. [2025-02-05 17:15:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:15:58,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:15:58,286 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, 1, 1] [2025-02-05 17:15:58,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:15:58,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:15:58,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:15:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -564192887, now seen corresponding path program 1 times [2025-02-05 17:15:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:15:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563501004] [2025-02-05 17:15:58,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:15:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:15:58,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:15:58,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:15:58,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:15:58,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:15:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:15:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:15:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563501004] [2025-02-05 17:15:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563501004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:15:58,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:15:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:15:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713978410] [2025-02-05 17:15:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:15:58,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:15:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:15:58,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:15:58,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:15:58,422 INFO L87 Difference]: Start difference. First operand 57812 states and 107796 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:16:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:01,439 INFO L93 Difference]: Finished difference Result 128810 states and 252330 transitions. [2025-02-05 17:16:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:01,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:16:01,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:01,764 INFO L225 Difference]: With dead ends: 128810 [2025-02-05 17:16:01,764 INFO L226 Difference]: Without dead ends: 73135 [2025-02-05 17:16:01,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:01,912 INFO L435 NwaCegarLoop]: 4271 mSDtfsCounter, 4556 mSDsluCounter, 8438 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4572 SdHoareTripleChecker+Valid, 12709 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-02-05 17:16:01,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4572 Valid, 12709 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:16:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73135 states. [2025-02-05 17:16:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73135 to 57812. [2025-02-05 17:16:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57812 states, 52904 states have (on average 1.6471533343414486) internal successors, (87141), 54967 states have internal predecessors, (87141), 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-02-05 17:16:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107667 transitions. [2025-02-05 17:16:07,464 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107667 transitions. Word has length 135 [2025-02-05 17:16:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:07,465 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107667 transitions. [2025-02-05 17:16:07,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:16:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107667 transitions. [2025-02-05 17:16:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:16:07,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:07,481 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, 1, 1] [2025-02-05 17:16:07,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:16:07,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:07,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 130454120, now seen corresponding path program 1 times [2025-02-05 17:16:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:07,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213995966] [2025-02-05 17:16:07,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:07,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:16:07,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:16:07,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:07,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213995966] [2025-02-05 17:16:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213995966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:07,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968759996] [2025-02-05 17:16:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:07,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:07,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:07,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:07,559 INFO L87 Difference]: Start difference. First operand 57812 states and 107667 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:16:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:10,350 INFO L93 Difference]: Finished difference Result 126621 states and 247694 transitions. [2025-02-05 17:16:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:10,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-02-05 17:16:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:10,711 INFO L225 Difference]: With dead ends: 126621 [2025-02-05 17:16:10,711 INFO L226 Difference]: Without dead ends: 70946 [2025-02-05 17:16:10,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:10,994 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4542 mSDsluCounter, 8446 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 12727 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-02-05 17:16:10,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4558 Valid, 12727 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:16:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70946 states. [2025-02-05 17:16:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70946 to 57812. [2025-02-05 17:16:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57812 states, 52904 states have (on average 1.6447149553908966) internal successors, (87012), 54967 states have internal predecessors, (87012), 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-02-05 17:16:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107538 transitions. [2025-02-05 17:16:15,174 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107538 transitions. Word has length 135 [2025-02-05 17:16:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:15,175 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107538 transitions. [2025-02-05 17:16:15,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:16:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107538 transitions. [2025-02-05 17:16:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:16:15,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:15,190 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, 1, 1] [2025-02-05 17:16:15,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:16:15,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:15,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1261240745, now seen corresponding path program 1 times [2025-02-05 17:16:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:15,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639530176] [2025-02-05 17:16:15,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:16:15,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:16:15,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:15,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:15,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:15,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639530176] [2025-02-05 17:16:15,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639530176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:15,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:15,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:15,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228786478] [2025-02-05 17:16:15,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:15,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:15,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:15,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:15,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:15,291 INFO L87 Difference]: Start difference. First operand 57812 states and 107538 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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)