./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_label43+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 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:10:13,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:10:13,785 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:10:13,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:10:13,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:10:13,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:10:13,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:10:13,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:10:13,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:10:13,820 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:10:13,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:10:13,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:10:13,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:10:13,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:10:13,822 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:10:13,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:10:13,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:10:13,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:10:13,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:10:13,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:10:13,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:10:13,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:10:13,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:10:13,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:10:13,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:10:13,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:10:13,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:10:13,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:10:13,826 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 -> 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 [2025-02-05 17:10:14,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:10:14,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:10:14,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:10:14,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:10:14,120 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:10:14,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2025-02-05 17:10:15,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a14fbc314/ee4f1182d9794a4cb6c9e5e01d86ad04/FLAG74114b975 [2025-02-05 17:10:16,065 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:10:16,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2025-02-05 17:10:16,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a14fbc314/ee4f1182d9794a4cb6c9e5e01d86ad04/FLAG74114b975 [2025-02-05 17:10:16,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a14fbc314/ee4f1182d9794a4cb6c9e5e01d86ad04 [2025-02-05 17:10:16,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:10:16,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:10:16,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:10:16,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:10:16,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:10:16,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:10:16" (1/1) ... [2025-02-05 17:10:16,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572e1060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:16, skipping insertion in model container [2025-02-05 17:10:16,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:10:16" (1/1) ... [2025-02-05 17:10:16,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:10:18,037 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_label43+token_ring.08.cil-2.c[381679,381692] [2025-02-05 17:10:18,073 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_label43+token_ring.08.cil-2.c[383339,383352] [2025-02-05 17:10:18,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:10:18,353 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:10:18,990 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_label43+token_ring.08.cil-2.c[381679,381692] [2025-02-05 17:10:18,994 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_label43+token_ring.08.cil-2.c[383339,383352] [2025-02-05 17:10:19,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:10:19,071 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:10:19,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19 WrapperNode [2025-02-05 17:10:19,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:10:19,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:10:19,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:10:19,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:10:19,080 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:10:19" (1/1) ... [2025-02-05 17:10:19,157 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:10:19" (1/1) ... [2025-02-05 17:10:19,509 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-02-05 17:10:19,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:10:19,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:10:19,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:10:19,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:10:19,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:19,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:19,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:19,678 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:10:19,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:19,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:20,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:20,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:20,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:20,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:20,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:10:20,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:10:20,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:10:20,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:10:20,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (1/1) ... [2025-02-05 17:10:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:10:20,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:10:20,183 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:10:20,186 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:10:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:10:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:10:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:10:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:10:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:10:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:10:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:10:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:10:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:10:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:10:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:10:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:10:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:10:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:10:20,210 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:10:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:10:20,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:10:20,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:10:20,340 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:10:20,342 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:10:28,349 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:10:28,350 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:10:28,351 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:10:28,352 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:10:28,352 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:10:28,352 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:10:28,354 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:10:28,657 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2025-02-05 17:10:28,657 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:10:28,743 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:10:28,748 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:10:28,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:28 BoogieIcfgContainer [2025-02-05 17:10:28,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:10:28,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:10:28,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:10:28,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:10:28,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:10:16" (1/3) ... [2025-02-05 17:10:28,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a419fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:28, skipping insertion in model container [2025-02-05 17:10:28,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:19" (2/3) ... [2025-02-05 17:10:28,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a419fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:28, skipping insertion in model container [2025-02-05 17:10:28,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:28" (3/3) ... [2025-02-05 17:10:28,759 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.08.cil-2.c [2025-02-05 17:10:28,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:10:28,779 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+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:10:28,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:10:28,913 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;@50055cb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:10:28,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:10:28,928 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:10:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:28,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:28,950 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:10:28,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1770730538, now seen corresponding path program 1 times [2025-02-05 17:10:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910306445] [2025-02-05 17:10:28,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:29,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:29,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:29,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:29,613 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:10:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910306445] [2025-02-05 17:10:29,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910306445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:29,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:29,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:29,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27349826] [2025-02-05 17:10:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:29,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:29,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:29,653 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:10:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:30,488 INFO L93 Difference]: Finished difference Result 5286 states and 9615 transitions. [2025-02-05 17:10:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:10:30,490 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:10:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:30,519 INFO L225 Difference]: With dead ends: 5286 [2025-02-05 17:10:30,519 INFO L226 Difference]: Without dead ends: 2741 [2025-02-05 17:10:30,529 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:10:30,531 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4868 mSDsluCounter, 8988 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:30,532 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.5s Time] [2025-02-05 17:10:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2025-02-05 17:10:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2718. [2025-02-05 17:10:30,682 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:10:30,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 4874 transitions. [2025-02-05 17:10:30,703 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 4874 transitions. Word has length 135 [2025-02-05 17:10:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:30,704 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 4874 transitions. [2025-02-05 17:10:30,704 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:10:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 4874 transitions. [2025-02-05 17:10:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:30,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:30,714 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:10:30,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:10:30,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1089729320, now seen corresponding path program 1 times [2025-02-05 17:10:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191289199] [2025-02-05 17:10:30,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:30,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:30,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:31,045 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:10:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191289199] [2025-02-05 17:10:31,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191289199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306674491] [2025-02-05 17:10:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:31,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:31,051 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:10:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:31,475 INFO L93 Difference]: Finished difference Result 3353 states and 5869 transitions. [2025-02-05 17:10:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:31,475 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:10:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:31,490 INFO L225 Difference]: With dead ends: 3353 [2025-02-05 17:10:31,491 INFO L226 Difference]: Without dead ends: 2772 [2025-02-05 17:10:31,494 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:10:31,496 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.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:31,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 12811 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2025-02-05 17:10:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2718. [2025-02-05 17:10:31,567 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:10:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 4872 transitions. [2025-02-05 17:10:31,582 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 4872 transitions. Word has length 135 [2025-02-05 17:10:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:31,583 INFO L471 AbstractCegarLoop]: Abstraction has 2718 states and 4872 transitions. [2025-02-05 17:10:31,583 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:10:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 4872 transitions. [2025-02-05 17:10:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:31,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:31,587 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:10:31,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:10:31,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:31,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -93288215, now seen corresponding path program 1 times [2025-02-05 17:10:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379264625] [2025-02-05 17:10:31,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:31,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:31,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:31,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:31,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:31,820 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:10:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379264625] [2025-02-05 17:10:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379264625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:31,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588790243] [2025-02-05 17:10:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:31,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:31,822 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:10:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:32,605 INFO L93 Difference]: Finished difference Result 3665 states and 6344 transitions. [2025-02-05 17:10:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:32,606 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:10:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:32,624 INFO L225 Difference]: With dead ends: 3665 [2025-02-05 17:10:32,625 INFO L226 Difference]: Without dead ends: 3084 [2025-02-05 17:10:32,628 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:10:32,631 INFO L435 NwaCegarLoop]: 4570 mSDtfsCounter, 4794 mSDsluCounter, 13748 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:32,632 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.6s Time] [2025-02-05 17:10:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2025-02-05 17:10:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2993. [2025-02-05 17:10:32,718 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:10:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 5288 transitions. [2025-02-05 17:10:32,735 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 5288 transitions. Word has length 135 [2025-02-05 17:10:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:32,736 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 5288 transitions. [2025-02-05 17:10:32,736 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:10:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 5288 transitions. [2025-02-05 17:10:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:32,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:32,740 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:10:32,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:10:32,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:32,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1239828728, now seen corresponding path program 1 times [2025-02-05 17:10:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715486800] [2025-02-05 17:10:32,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:32,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:32,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:32,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:32,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:32,947 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:10:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715486800] [2025-02-05 17:10:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715486800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731938346] [2025-02-05 17:10:32,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:32,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:32,950 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:10:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:33,741 INFO L93 Difference]: Finished difference Result 4533 states and 7677 transitions. [2025-02-05 17:10:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:33,742 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:10:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:33,763 INFO L225 Difference]: With dead ends: 4533 [2025-02-05 17:10:33,764 INFO L226 Difference]: Without dead ends: 3677 [2025-02-05 17:10:33,769 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:10:33,770 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:33,770 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.6s Time] [2025-02-05 17:10:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2025-02-05 17:10:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3574. [2025-02-05 17:10:33,889 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:10:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 6181 transitions. [2025-02-05 17:10:33,914 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 6181 transitions. Word has length 135 [2025-02-05 17:10:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:33,915 INFO L471 AbstractCegarLoop]: Abstraction has 3574 states and 6181 transitions. [2025-02-05 17:10:33,915 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:10:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 6181 transitions. [2025-02-05 17:10:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:33,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:33,918 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:10:33,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:10:33,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:33,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1771227401, now seen corresponding path program 1 times [2025-02-05 17:10:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477964178] [2025-02-05 17:10:33,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:33,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:33,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:33,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:33,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:34,147 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:10:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477964178] [2025-02-05 17:10:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477964178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:34,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:34,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:34,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073405082] [2025-02-05 17:10:34,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:34,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:34,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:34,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:34,149 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:10:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:34,966 INFO L93 Difference]: Finished difference Result 6388 states and 10584 transitions. [2025-02-05 17:10:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:34,967 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:10:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:34,994 INFO L225 Difference]: With dead ends: 6388 [2025-02-05 17:10:34,995 INFO L226 Difference]: Without dead ends: 4951 [2025-02-05 17:10:35,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:10:35,003 INFO L435 NwaCegarLoop]: 4342 mSDtfsCounter, 4811 mSDsluCounter, 13193 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:35,003 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.6s Time] [2025-02-05 17:10:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2025-02-05 17:10:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4823. [2025-02-05 17:10:35,225 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:10:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 8145 transitions. [2025-02-05 17:10:35,256 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 8145 transitions. Word has length 135 [2025-02-05 17:10:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:35,257 INFO L471 AbstractCegarLoop]: Abstraction has 4823 states and 8145 transitions. [2025-02-05 17:10:35,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:10:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 8145 transitions. [2025-02-05 17:10:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:35,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:35,265 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:10:35,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:10:35,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:35,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2006905576, now seen corresponding path program 1 times [2025-02-05 17:10:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828914058] [2025-02-05 17:10:35,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:35,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:35,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:35,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:35,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:35,458 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:10:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828914058] [2025-02-05 17:10:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828914058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929200471] [2025-02-05 17:10:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:35,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:35,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:35,461 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:10:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:36,369 INFO L93 Difference]: Finished difference Result 10427 states and 17098 transitions. [2025-02-05 17:10:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:36,370 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:10:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:36,423 INFO L225 Difference]: With dead ends: 10427 [2025-02-05 17:10:36,424 INFO L226 Difference]: Without dead ends: 7741 [2025-02-05 17:10:36,436 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:10:36,437 INFO L435 NwaCegarLoop]: 4560 mSDtfsCounter, 4779 mSDsluCounter, 13718 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:36,437 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.6s Time] [2025-02-05 17:10:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2025-02-05 17:10:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 7564. [2025-02-05 17:10:36,692 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:10:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 12597 transitions. [2025-02-05 17:10:36,723 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 12597 transitions. Word has length 135 [2025-02-05 17:10:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:36,724 INFO L471 AbstractCegarLoop]: Abstraction has 7564 states and 12597 transitions. [2025-02-05 17:10:36,724 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:10:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 12597 transitions. [2025-02-05 17:10:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:36,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:36,730 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:10:36,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:10:36,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:36,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1183224105, now seen corresponding path program 1 times [2025-02-05 17:10:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299494306] [2025-02-05 17:10:36,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:36,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:36,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:36,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:36,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:36,881 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:10:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299494306] [2025-02-05 17:10:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299494306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:36,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109829706] [2025-02-05 17:10:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:36,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:36,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:36,883 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:10:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:37,915 INFO L93 Difference]: Finished difference Result 19418 states and 32204 transitions. [2025-02-05 17:10:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:37,916 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:10:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:37,996 INFO L225 Difference]: With dead ends: 19418 [2025-02-05 17:10:37,996 INFO L226 Difference]: Without dead ends: 13991 [2025-02-05 17:10:38,023 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:10:38,024 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:10:38,024 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:10:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13991 states. [2025-02-05 17:10:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13991 to 13721. [2025-02-05 17:10:38,534 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:10:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 23065 transitions. [2025-02-05 17:10:38,590 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 23065 transitions. Word has length 135 [2025-02-05 17:10:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:38,590 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 23065 transitions. [2025-02-05 17:10:38,591 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:10:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 23065 transitions. [2025-02-05 17:10:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:38,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:38,601 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:10:38,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:10:38,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:38,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:38,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2029934904, now seen corresponding path program 1 times [2025-02-05 17:10:38,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:38,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579581413] [2025-02-05 17:10:38,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:38,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:38,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:38,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:38,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:38,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:38,734 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:10:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579581413] [2025-02-05 17:10:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579581413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:38,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795515699] [2025-02-05 17:10:38,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:38,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:38,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:38,736 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:10:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:39,520 INFO L93 Difference]: Finished difference Result 28245 states and 48382 transitions. [2025-02-05 17:10:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:39,521 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:10:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:39,603 INFO L225 Difference]: With dead ends: 28245 [2025-02-05 17:10:39,606 INFO L226 Difference]: Without dead ends: 16661 [2025-02-05 17:10:39,650 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:10:39,651 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:39,652 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.3s Time] [2025-02-05 17:10:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16661 states. [2025-02-05 17:10:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16661 to 13721. [2025-02-05 17:10:40,204 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:10:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 23032 transitions. [2025-02-05 17:10:40,254 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 23032 transitions. Word has length 135 [2025-02-05 17:10:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:40,254 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 23032 transitions. [2025-02-05 17:10:40,255 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:10:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 23032 transitions. [2025-02-05 17:10:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:40,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:40,264 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:10:40,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:10:40,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:40,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1745740105, now seen corresponding path program 1 times [2025-02-05 17:10:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:40,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391380391] [2025-02-05 17:10:40,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:40,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:40,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:40,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:40,400 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:10:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391380391] [2025-02-05 17:10:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391380391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:40,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:40,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:40,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920223888] [2025-02-05 17:10:40,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:40,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:40,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:40,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:40,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:40,403 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:10:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:41,129 INFO L93 Difference]: Finished difference Result 28000 states and 47826 transitions. [2025-02-05 17:10:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:41,130 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:10:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:41,271 INFO L225 Difference]: With dead ends: 28000 [2025-02-05 17:10:41,272 INFO L226 Difference]: Without dead ends: 16416 [2025-02-05 17:10:41,311 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:10:41,313 INFO L435 NwaCegarLoop]: 4294 mSDtfsCounter, 4555 mSDsluCounter, 8471 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:10:41,314 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:10:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2025-02-05 17:10:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 13721. [2025-02-05 17:10:42,033 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:10:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 22999 transitions. [2025-02-05 17:10:42,088 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 22999 transitions. Word has length 135 [2025-02-05 17:10:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:42,089 INFO L471 AbstractCegarLoop]: Abstraction has 13721 states and 22999 transitions. [2025-02-05 17:10:42,089 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:10:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 22999 transitions. [2025-02-05 17:10:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:42,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:42,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:42,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:10:42,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash 759157416, now seen corresponding path program 1 times [2025-02-05 17:10:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:42,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278554868] [2025-02-05 17:10:42,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:42,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:42,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:42,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:42,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:42,270 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:10:42,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:42,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278554868] [2025-02-05 17:10:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278554868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:42,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:42,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:42,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254855218] [2025-02-05 17:10:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:42,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:42,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:42,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:42,272 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:10:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:43,782 INFO L93 Difference]: Finished difference Result 41321 states and 70381 transitions. [2025-02-05 17:10:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:43,782 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:10:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:43,927 INFO L225 Difference]: With dead ends: 41321 [2025-02-05 17:10:43,928 INFO L226 Difference]: Without dead ends: 29737 [2025-02-05 17:10:43,975 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:10:43,976 INFO L435 NwaCegarLoop]: 4542 mSDtfsCounter, 5007 mSDsluCounter, 13661 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:43,976 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.6s Time] [2025-02-05 17:10:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29737 states. [2025-02-05 17:10:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29737 to 27316. [2025-02-05 17:10:45,159 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:10:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 47531 transitions. [2025-02-05 17:10:45,263 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 47531 transitions. Word has length 135 [2025-02-05 17:10:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:45,264 INFO L471 AbstractCegarLoop]: Abstraction has 27316 states and 47531 transitions. [2025-02-05 17:10:45,264 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:10:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 47531 transitions. [2025-02-05 17:10:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:45,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:45,277 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:10:45,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:10:45,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1835710825, now seen corresponding path program 1 times [2025-02-05 17:10:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:45,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798095884] [2025-02-05 17:10:45,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:45,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:45,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:45,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:45,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:45,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:45,393 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:10:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798095884] [2025-02-05 17:10:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798095884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:45,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735578434] [2025-02-05 17:10:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:45,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:45,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:45,396 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:10:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:46,764 INFO L93 Difference]: Finished difference Result 59074 states and 106270 transitions. [2025-02-05 17:10:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:46,765 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:10:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:46,934 INFO L225 Difference]: With dead ends: 59074 [2025-02-05 17:10:46,934 INFO L226 Difference]: Without dead ends: 33895 [2025-02-05 17:10:46,998 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:10:46,998 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:10:46,999 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:10:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33895 states. [2025-02-05 17:10:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33895 to 27316. [2025-02-05 17:10:49,066 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:10:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 47466 transitions. [2025-02-05 17:10:49,207 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 47466 transitions. Word has length 135 [2025-02-05 17:10:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:49,208 INFO L471 AbstractCegarLoop]: Abstraction has 27316 states and 47466 transitions. [2025-02-05 17:10:49,208 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:10:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 47466 transitions. [2025-02-05 17:10:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:49,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:49,221 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:10:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:10:49,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -623413624, now seen corresponding path program 1 times [2025-02-05 17:10:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480843672] [2025-02-05 17:10:49,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:49,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:49,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:49,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:49,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:49,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:49,494 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:10:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480843672] [2025-02-05 17:10:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480843672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630358573] [2025-02-05 17:10:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:49,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:49,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:49,495 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:10:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:51,833 INFO L93 Difference]: Finished difference Result 86750 states and 157276 transitions. [2025-02-05 17:10:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:51,834 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:10:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:52,223 INFO L225 Difference]: With dead ends: 86750 [2025-02-05 17:10:52,223 INFO L226 Difference]: Without dead ends: 61571 [2025-02-05 17:10:52,362 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:10:52,364 INFO L435 NwaCegarLoop]: 4534 mSDtfsCounter, 4934 mSDsluCounter, 13638 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:52,364 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.6s Time] [2025-02-05 17:10:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61571 states. [2025-02-05 17:10:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61571 to 57812. [2025-02-05 17:10:55,675 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:10:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107796 transitions. [2025-02-05 17:10:55,998 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107796 transitions. Word has length 135 [2025-02-05 17:10:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:55,998 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107796 transitions. [2025-02-05 17:10:55,998 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:10:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107796 transitions. [2025-02-05 17:10:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:10:56,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:56,026 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:10:56,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:10:56,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:56,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -564192887, now seen corresponding path program 1 times [2025-02-05 17:10:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293053488] [2025-02-05 17:10:56,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:56,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:10:56,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:10:56,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:56,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:56,143 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:10:56,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:56,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293053488] [2025-02-05 17:10:56,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293053488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:56,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:56,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810529697] [2025-02-05 17:10:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:56,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:56,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:56,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:56,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:56,147 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:10:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:59,152 INFO L93 Difference]: Finished difference Result 128810 states and 252330 transitions. [2025-02-05 17:10:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:59,153 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:10:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:59,502 INFO L225 Difference]: With dead ends: 128810 [2025-02-05 17:10:59,502 INFO L226 Difference]: Without dead ends: 73135 [2025-02-05 17:10:59,869 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:10:59,876 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:59,876 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.3s Time] [2025-02-05 17:10:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73135 states. [2025-02-05 17:11:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73135 to 57812. [2025-02-05 17:11:04,229 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:11:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107667 transitions. [2025-02-05 17:11:04,833 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107667 transitions. Word has length 135 [2025-02-05 17:11:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:04,836 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107667 transitions. [2025-02-05 17:11:04,836 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:11:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107667 transitions. [2025-02-05 17:11:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:11:04,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:04,858 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:11:04,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:11:04,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:04,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash 130454120, now seen corresponding path program 1 times [2025-02-05 17:11:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290371194] [2025-02-05 17:11:04,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:04,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:04,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:11:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:11:04,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:04,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:04,973 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:11:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290371194] [2025-02-05 17:11:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290371194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680559678] [2025-02-05 17:11:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:04,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:04,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:04,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:04,976 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:11:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:08,292 INFO L93 Difference]: Finished difference Result 126621 states and 247694 transitions. [2025-02-05 17:11:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:08,292 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:11:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:08,616 INFO L225 Difference]: With dead ends: 126621 [2025-02-05 17:11:08,616 INFO L226 Difference]: Without dead ends: 70946 [2025-02-05 17:11:08,705 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:11:08,706 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:08,706 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.3s Time] [2025-02-05 17:11:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70946 states. [2025-02-05 17:11:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70946 to 57812. [2025-02-05 17:11:11,540 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:11:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57812 states to 57812 states and 107538 transitions. [2025-02-05 17:11:11,802 INFO L78 Accepts]: Start accepts. Automaton has 57812 states and 107538 transitions. Word has length 135 [2025-02-05 17:11:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:11,802 INFO L471 AbstractCegarLoop]: Abstraction has 57812 states and 107538 transitions. [2025-02-05 17:11:11,802 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:11:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 57812 states and 107538 transitions. [2025-02-05 17:11:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 17:11:11,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:11,817 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:11:11,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:11:11,817 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1261240745, now seen corresponding path program 1 times [2025-02-05 17:11:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847501367] [2025-02-05 17:11:11,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:11,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 17:11:11,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 17:11:11,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:11,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:11,924 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:11:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847501367] [2025-02-05 17:11:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847501367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44539681] [2025-02-05 17:11:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:11,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:11,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:11,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:11,928 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) [2025-02-05 17:11:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:17,945 INFO L93 Difference]: Finished difference Result 183780 states and 368810 transitions. [2025-02-05 17:11:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:17,946 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:11:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:18,511 INFO L225 Difference]: With dead ends: 183780 [2025-02-05 17:11:18,511 INFO L226 Difference]: Without dead ends: 128105 [2025-02-05 17:11:18,780 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:11:18,781 INFO L435 NwaCegarLoop]: 4521 mSDtfsCounter, 4823 mSDsluCounter, 13601 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4848 SdHoareTripleChecker+Valid, 18122 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:11:18,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4848 Valid, 18122 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:11:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128105 states.