./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.14.cil.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_label42+token_ring.14.cil.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 baf2679bf12305063b7a185b7ceccd8123ae67f841713533125dfbe04aeffae0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:08:59,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:08:59,624 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:08:59,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:08:59,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:08:59,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:08:59,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:08:59,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:08:59,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:08:59,648 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:08:59,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:08:59,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:08:59,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:08:59,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:08:59,648 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:08:59,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:08:59,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:08:59,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:08:59,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:08:59,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:08:59,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:08:59,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:08:59,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:08:59,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:08:59,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:08:59,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:08:59,651 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 -> baf2679bf12305063b7a185b7ceccd8123ae67f841713533125dfbe04aeffae0 [2025-02-05 17:08:59,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:08:59,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:08:59,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:08:59,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:08:59,920 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:08:59,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.14.cil.c [2025-02-05 17:09:01,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c9530b2b/f78a325ccfef49e3a63d0d08bf68aaf3/FLAG343d7a8a4 [2025-02-05 17:09:01,882 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:09:01,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.14.cil.c [2025-02-05 17:09:01,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c9530b2b/f78a325ccfef49e3a63d0d08bf68aaf3/FLAG343d7a8a4 [2025-02-05 17:09:02,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c9530b2b/f78a325ccfef49e3a63d0d08bf68aaf3 [2025-02-05 17:09:02,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:09:02,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:09:02,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:02,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:09:02,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:09:02,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:02" (1/1) ... [2025-02-05 17:09:02,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcac649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:02, skipping insertion in model container [2025-02-05 17:09:02,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:02" (1/1) ... [2025-02-05 17:09:02,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:09:03,871 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_label42+token_ring.14.cil.c[378560,378573] [2025-02-05 17:09:03,900 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_label42+token_ring.14.cil.c[383339,383352] [2025-02-05 17:09:04,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:04,155 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:09:04,711 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_label42+token_ring.14.cil.c[378560,378573] [2025-02-05 17:09:04,715 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_label42+token_ring.14.cil.c[383339,383352] [2025-02-05 17:09:04,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:04,781 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:09:04,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04 WrapperNode [2025-02-05 17:09:04,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:04,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:04,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:09:04,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:09:04,788 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:09:04" (1/1) ... [2025-02-05 17:09:04,844 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:09:04" (1/1) ... [2025-02-05 17:09:05,125 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13189 [2025-02-05 17:09:05,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:05,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:09:05,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:09:05,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:09:05,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,324 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:09:05,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:09:05,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:09:05,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:09:05,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:09:05,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (1/1) ... [2025-02-05 17:09:05,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:05,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:05,717 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:09:05,728 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:09:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:09:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:09:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:09:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:09:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:09:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:09:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:09:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:09:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:09:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:09:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:09:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:09:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:09:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:09:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:09:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:09:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:09:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:09:05,892 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:09:05,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:09:12,641 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:09:12,641 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:09:12,642 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:09:12,642 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:09:12,643 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:09:12,643 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:09:12,644 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:09:13,024 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2025-02-05 17:09:13,025 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:09:13,088 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:09:13,088 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:09:13,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:13 BoogieIcfgContainer [2025-02-05 17:09:13,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:09:13,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:09:13,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:09:13,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:09:13,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:09:02" (1/3) ... [2025-02-05 17:09:13,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3296f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:13, skipping insertion in model container [2025-02-05 17:09:13,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:04" (2/3) ... [2025-02-05 17:09:13,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3296f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:13, skipping insertion in model container [2025-02-05 17:09:13,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:13" (3/3) ... [2025-02-05 17:09:13,098 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.14.cil.c [2025-02-05 17:09:13,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:09:13,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.14.cil.c that has 8 procedures, 2597 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-02-05 17:09:13,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:09:13,238 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;@18dbfac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:09:13,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:09:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 2597 states, 2559 states have (on average 1.8284486127393513) internal successors, (4679), 2564 states have internal predecessors, (4679), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 17:09:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:13,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:13,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:13,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:13,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash 505805513, now seen corresponding path program 1 times [2025-02-05 17:09:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:13,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198236372] [2025-02-05 17:09:13,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:13,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:13,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:13,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:13,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:13,829 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:09:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198236372] [2025-02-05 17:09:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198236372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:13,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:13,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183832900] [2025-02-05 17:09:13,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:13,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:13,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:13,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:13,864 INFO L87 Difference]: Start difference. First operand has 2597 states, 2559 states have (on average 1.8284486127393513) internal successors, (4679), 2564 states have internal predecessors, (4679), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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:09:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:14,892 INFO L93 Difference]: Finished difference Result 5612 states and 10147 transitions. [2025-02-05 17:09:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:09:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:14,923 INFO L225 Difference]: With dead ends: 5612 [2025-02-05 17:09:14,923 INFO L226 Difference]: Without dead ends: 2965 [2025-02-05 17:09:14,934 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:09:14,939 INFO L435 NwaCegarLoop]: 4523 mSDtfsCounter, 5212 mSDsluCounter, 9336 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5232 SdHoareTripleChecker+Valid, 13859 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:14,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 13859 Invalid, 697 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:09:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-02-05 17:09:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2934. [2025-02-05 17:09:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2870 states have (on average 1.7843205574912893) internal successors, (5121), 2874 states have internal predecessors, (5121), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:09:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5218 transitions. [2025-02-05 17:09:15,133 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5218 transitions. Word has length 179 [2025-02-05 17:09:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:15,133 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5218 transitions. [2025-02-05 17:09:15,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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:09:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5218 transitions. [2025-02-05 17:09:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:15,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:15,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:15,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:09:15,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:15,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1960419271, now seen corresponding path program 1 times [2025-02-05 17:09:15,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:15,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521329475] [2025-02-05 17:09:15,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:15,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:15,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:15,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:15,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:15,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:15,431 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:09:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521329475] [2025-02-05 17:09:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521329475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:15,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:15,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:15,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834604777] [2025-02-05 17:09:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:15,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:15,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:15,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:15,436 INFO L87 Difference]: Start difference. First operand 2934 states and 5218 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:15,828 INFO L93 Difference]: Finished difference Result 3805 states and 6597 transitions. [2025-02-05 17:09:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:15,841 INFO L225 Difference]: With dead ends: 3805 [2025-02-05 17:09:15,841 INFO L226 Difference]: Without dead ends: 3012 [2025-02-05 17:09:15,844 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:09:15,844 INFO L435 NwaCegarLoop]: 4442 mSDtfsCounter, 4806 mSDsluCounter, 8725 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4826 SdHoareTripleChecker+Valid, 13167 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:15,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4826 Valid, 13167 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-02-05 17:09:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2934. [2025-02-05 17:09:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2870 states have (on average 1.7836236933797909) internal successors, (5119), 2874 states have internal predecessors, (5119), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:09:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5216 transitions. [2025-02-05 17:09:15,903 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5216 transitions. Word has length 179 [2025-02-05 17:09:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:15,903 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5216 transitions. [2025-02-05 17:09:15,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5216 transitions. [2025-02-05 17:09:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:15,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:15,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:15,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:09:15,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1075683464, now seen corresponding path program 1 times [2025-02-05 17:09:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:15,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873003080] [2025-02-05 17:09:15,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:15,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:15,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:15,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:16,233 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:09:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873003080] [2025-02-05 17:09:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873003080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599336716] [2025-02-05 17:09:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:16,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:16,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:16,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:16,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:16,235 INFO L87 Difference]: Start difference. First operand 2934 states and 5216 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:16,891 INFO L93 Difference]: Finished difference Result 4235 states and 7264 transitions. [2025-02-05 17:09:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:16,903 INFO L225 Difference]: With dead ends: 4235 [2025-02-05 17:09:16,904 INFO L226 Difference]: Without dead ends: 3442 [2025-02-05 17:09:16,906 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:09:16,906 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 5176 mSDsluCounter, 13787 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5196 SdHoareTripleChecker+Valid, 18323 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:16,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5196 Valid, 18323 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:09:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-05 17:09:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3311. [2025-02-05 17:09:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3219 states have (on average 1.7552034793414104) internal successors, (5650), 3224 states have internal predecessors, (5650), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-02-05 17:09:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 5792 transitions. [2025-02-05 17:09:16,976 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 5792 transitions. Word has length 179 [2025-02-05 17:09:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:16,976 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 5792 transitions. [2025-02-05 17:09:16,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 5792 transitions. [2025-02-05 17:09:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:16,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:16,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:16,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:09:16,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:16,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash 770048935, now seen corresponding path program 1 times [2025-02-05 17:09:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:16,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453638075] [2025-02-05 17:09:16,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:16,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:16,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:16,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:16,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:17,123 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:09:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453638075] [2025-02-05 17:09:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453638075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766163409] [2025-02-05 17:09:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:17,125 INFO L87 Difference]: Start difference. First operand 3311 states and 5792 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:17,877 INFO L93 Difference]: Finished difference Result 5433 states and 9125 transitions. [2025-02-05 17:09:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:17,894 INFO L225 Difference]: With dead ends: 5433 [2025-02-05 17:09:17,894 INFO L226 Difference]: Without dead ends: 4263 [2025-02-05 17:09:17,898 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:09:17,899 INFO L435 NwaCegarLoop]: 4794 mSDtfsCounter, 5141 mSDsluCounter, 14460 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5161 SdHoareTripleChecker+Valid, 19254 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:17,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5161 Valid, 19254 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:09:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-02-05 17:09:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4112. [2025-02-05 17:09:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 3962 states have (on average 1.716052498738011) internal successors, (6799), 3971 states have internal predecessors, (6799), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-02-05 17:09:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 7037 transitions. [2025-02-05 17:09:17,996 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 7037 transitions. Word has length 179 [2025-02-05 17:09:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:17,996 INFO L471 AbstractCegarLoop]: Abstraction has 4112 states and 7037 transitions. [2025-02-05 17:09:17,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 7037 transitions. [2025-02-05 17:09:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:17,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:17,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:17,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:09:17,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 67453096, now seen corresponding path program 1 times [2025-02-05 17:09:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047024917] [2025-02-05 17:09:18,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:18,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:18,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:18,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:18,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:18,151 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:09:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047024917] [2025-02-05 17:09:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047024917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:18,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072761887] [2025-02-05 17:09:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:18,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:18,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:18,153 INFO L87 Difference]: Start difference. First operand 4112 states and 7037 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:19,023 INFO L93 Difference]: Finished difference Result 8012 states and 13216 transitions. [2025-02-05 17:09:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:19,047 INFO L225 Difference]: With dead ends: 8012 [2025-02-05 17:09:19,047 INFO L226 Difference]: Without dead ends: 6041 [2025-02-05 17:09:19,054 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:09:19,055 INFO L435 NwaCegarLoop]: 4791 mSDtfsCounter, 5136 mSDsluCounter, 14451 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 19242 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:19,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 19242 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:09:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2025-02-05 17:09:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5849. [2025-02-05 17:09:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5849 states, 5577 states have (on average 1.675990675990676) internal successors, (9347), 5600 states have internal predecessors, (9347), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-02-05 17:09:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 9801 transitions. [2025-02-05 17:09:19,203 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 9801 transitions. Word has length 179 [2025-02-05 17:09:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:19,203 INFO L471 AbstractCegarLoop]: Abstraction has 5849 states and 9801 transitions. [2025-02-05 17:09:19,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 9801 transitions. [2025-02-05 17:09:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:19,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:19,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:19,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:09:19,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:19,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1014620039, now seen corresponding path program 1 times [2025-02-05 17:09:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354282203] [2025-02-05 17:09:19,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:19,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:19,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:19,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:19,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:19,339 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:09:19,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354282203] [2025-02-05 17:09:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354282203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:19,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073303885] [2025-02-05 17:09:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:19,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:19,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:19,341 INFO L87 Difference]: Start difference. First operand 5849 states and 9801 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:20,090 INFO L93 Difference]: Finished difference Result 13691 states and 22482 transitions. [2025-02-05 17:09:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:20,139 INFO L225 Difference]: With dead ends: 13691 [2025-02-05 17:09:20,140 INFO L226 Difference]: Without dead ends: 9983 [2025-02-05 17:09:20,152 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:09:20,154 INFO L435 NwaCegarLoop]: 4788 mSDtfsCounter, 5131 mSDsluCounter, 14442 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5151 SdHoareTripleChecker+Valid, 19230 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:20,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5151 Valid, 19230 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:09:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2025-02-05 17:09:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9710. [2025-02-05 17:09:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9710 states, 9176 states have (on average 1.652027027027027) internal successors, (15159), 9245 states have internal predecessors, (15159), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:09:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9710 states to 9710 states and 16141 transitions. [2025-02-05 17:09:20,483 INFO L78 Accepts]: Start accepts. Automaton has 9710 states and 16141 transitions. Word has length 179 [2025-02-05 17:09:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:20,484 INFO L471 AbstractCegarLoop]: Abstraction has 9710 states and 16141 transitions. [2025-02-05 17:09:20,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 9710 states and 16141 transitions. [2025-02-05 17:09:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:20,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:20,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:20,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:09:20,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:20,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1737910472, now seen corresponding path program 1 times [2025-02-05 17:09:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320478453] [2025-02-05 17:09:20,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:20,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:20,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:20,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:20,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:20,621 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:09:20,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:20,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320478453] [2025-02-05 17:09:20,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320478453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:20,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748489455] [2025-02-05 17:09:20,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:20,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:20,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:20,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:20,623 INFO L87 Difference]: Start difference. First operand 9710 states and 16141 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:21,462 INFO L93 Difference]: Finished difference Result 26538 states and 44244 transitions. [2025-02-05 17:09:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:21,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:21,518 INFO L225 Difference]: With dead ends: 26538 [2025-02-05 17:09:21,519 INFO L226 Difference]: Without dead ends: 18969 [2025-02-05 17:09:21,543 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:09:21,543 INFO L435 NwaCegarLoop]: 4785 mSDtfsCounter, 5126 mSDsluCounter, 14433 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 19218 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:21,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 19218 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:09:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18969 states. [2025-02-05 17:09:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18969 to 18539. [2025-02-05 17:09:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6541573420554312) internal successors, (28827), 17642 states have internal predecessors, (28827), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:09:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31249 transitions. [2025-02-05 17:09:22,230 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31249 transitions. Word has length 179 [2025-02-05 17:09:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:22,230 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31249 transitions. [2025-02-05 17:09:22,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31249 transitions. [2025-02-05 17:09:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:22,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:22,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:22,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:09:22,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:22,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash -871156889, now seen corresponding path program 1 times [2025-02-05 17:09:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:22,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882908480] [2025-02-05 17:09:22,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:22,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:22,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:22,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:22,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:22,372 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:09:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882908480] [2025-02-05 17:09:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882908480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:22,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:22,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:22,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390468786] [2025-02-05 17:09:22,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:22,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:22,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:22,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:22,376 INFO L87 Difference]: Start difference. First operand 18539 states and 31249 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:23,141 INFO L93 Difference]: Finished difference Result 39837 states and 68662 transitions. [2025-02-05 17:09:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:23,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:23,211 INFO L225 Difference]: With dead ends: 39837 [2025-02-05 17:09:23,212 INFO L226 Difference]: Without dead ends: 23439 [2025-02-05 17:09:23,246 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:09:23,247 INFO L435 NwaCegarLoop]: 4429 mSDtfsCounter, 4798 mSDsluCounter, 8700 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4818 SdHoareTripleChecker+Valid, 13129 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:23,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4818 Valid, 13129 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23439 states. [2025-02-05 17:09:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23439 to 18539. [2025-02-05 17:09:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6522637286968498) internal successors, (28794), 17642 states have internal predecessors, (28794), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:09:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31216 transitions. [2025-02-05 17:09:23,714 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31216 transitions. Word has length 179 [2025-02-05 17:09:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:23,715 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31216 transitions. [2025-02-05 17:09:23,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31216 transitions. [2025-02-05 17:09:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:23,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:23,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:23,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:09:23,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:23,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash -678225688, now seen corresponding path program 1 times [2025-02-05 17:09:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:23,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533056409] [2025-02-05 17:09:23,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:23,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:23,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:23,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:23,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:23,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:23,819 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:09:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533056409] [2025-02-05 17:09:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533056409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483412164] [2025-02-05 17:09:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:23,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:23,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:23,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:23,821 INFO L87 Difference]: Start difference. First operand 18539 states and 31216 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:24,434 INFO L93 Difference]: Finished difference Result 39592 states and 68106 transitions. [2025-02-05 17:09:24,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:24,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:24,511 INFO L225 Difference]: With dead ends: 39592 [2025-02-05 17:09:24,512 INFO L226 Difference]: Without dead ends: 23194 [2025-02-05 17:09:24,546 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:09:24,546 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4795 mSDsluCounter, 8695 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4815 SdHoareTripleChecker+Valid, 13121 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:24,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4815 Valid, 13121 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23194 states. [2025-02-05 17:09:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23194 to 18539. [2025-02-05 17:09:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6503701153382682) internal successors, (28761), 17642 states have internal predecessors, (28761), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:09:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31183 transitions. [2025-02-05 17:09:25,078 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31183 transitions. Word has length 179 [2025-02-05 17:09:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:25,079 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31183 transitions. [2025-02-05 17:09:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31183 transitions. [2025-02-05 17:09:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:25,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:25,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:09:25,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:25,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash -810549433, now seen corresponding path program 1 times [2025-02-05 17:09:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:25,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708819836] [2025-02-05 17:09:25,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:25,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:25,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:25,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:25,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:25,194 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:09:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708819836] [2025-02-05 17:09:25,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708819836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:25,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:25,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620361207] [2025-02-05 17:09:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:25,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:25,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:25,197 INFO L87 Difference]: Start difference. First operand 18539 states and 31183 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:26,538 INFO L93 Difference]: Finished difference Result 55929 states and 96212 transitions. [2025-02-05 17:09:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:26,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:26,666 INFO L225 Difference]: With dead ends: 55929 [2025-02-05 17:09:26,667 INFO L226 Difference]: Without dead ends: 39531 [2025-02-05 17:09:26,709 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:09:26,710 INFO L435 NwaCegarLoop]: 4772 mSDtfsCounter, 5105 mSDsluCounter, 14396 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5125 SdHoareTripleChecker+Valid, 19168 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:26,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5125 Valid, 19168 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:09:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39531 states. [2025-02-05 17:09:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39531 to 38870. [2025-02-05 17:09:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.670609220636663) internal successors, (60877), 37109 states have internal predecessors, (60877), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:09:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67715 transitions. [2025-02-05 17:09:28,222 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67715 transitions. Word has length 179 [2025-02-05 17:09:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:28,222 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67715 transitions. [2025-02-05 17:09:28,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67715 transitions. [2025-02-05 17:09:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:28,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:28,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:28,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:09:28,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash 155013384, now seen corresponding path program 1 times [2025-02-05 17:09:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295255055] [2025-02-05 17:09:28,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:28,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:28,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:28,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:28,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:28,320 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:09:28,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295255055] [2025-02-05 17:09:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295255055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:28,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:28,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:28,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170757316] [2025-02-05 17:09:28,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:28,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:28,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:28,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:28,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:28,322 INFO L87 Difference]: Start difference. First operand 38870 states and 67715 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:29,766 INFO L93 Difference]: Finished difference Result 88026 states and 158326 transitions. [2025-02-05 17:09:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:29,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:29,937 INFO L225 Difference]: With dead ends: 88026 [2025-02-05 17:09:29,937 INFO L226 Difference]: Without dead ends: 51297 [2025-02-05 17:09:30,015 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:09:30,016 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4822 mSDsluCounter, 8653 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 13041 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:30,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 13041 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51297 states. [2025-02-05 17:09:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51297 to 38870. [2025-02-05 17:09:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6688254665203073) internal successors, (60812), 37109 states have internal predecessors, (60812), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:09:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67650 transitions. [2025-02-05 17:09:31,637 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67650 transitions. Word has length 179 [2025-02-05 17:09:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:31,638 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67650 transitions. [2025-02-05 17:09:31,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67650 transitions. [2025-02-05 17:09:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:31,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:31,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:09:31,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -506576089, now seen corresponding path program 1 times [2025-02-05 17:09:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482025669] [2025-02-05 17:09:31,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:31,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:31,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:31,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:31,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:31,762 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:09:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482025669] [2025-02-05 17:09:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482025669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041560165] [2025-02-05 17:09:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:31,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:31,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:31,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:31,765 INFO L87 Difference]: Start difference. First operand 38870 states and 67650 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:33,548 INFO L93 Difference]: Finished difference Result 87295 states and 156734 transitions. [2025-02-05 17:09:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:33,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:33,703 INFO L225 Difference]: With dead ends: 87295 [2025-02-05 17:09:33,703 INFO L226 Difference]: Without dead ends: 50566 [2025-02-05 17:09:33,770 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:09:33,771 INFO L435 NwaCegarLoop]: 4418 mSDtfsCounter, 4788 mSDsluCounter, 8681 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4808 SdHoareTripleChecker+Valid, 13099 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:33,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4808 Valid, 13099 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50566 states. [2025-02-05 17:09:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50566 to 38870. [2025-02-05 17:09:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6670417124039516) internal successors, (60747), 37109 states have internal predecessors, (60747), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:09:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67585 transitions. [2025-02-05 17:09:35,549 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67585 transitions. Word has length 179 [2025-02-05 17:09:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:35,549 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67585 transitions. [2025-02-05 17:09:35,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67585 transitions. [2025-02-05 17:09:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:35,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:35,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:35,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:09:35,563 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:35,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 441913640, now seen corresponding path program 1 times [2025-02-05 17:09:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752258778] [2025-02-05 17:09:35,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:35,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:35,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:35,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:35,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:35,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:35,680 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:09:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:35,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752258778] [2025-02-05 17:09:35,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752258778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:35,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:35,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597223408] [2025-02-05 17:09:35,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:35,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:35,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:35,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:35,683 INFO L87 Difference]: Start difference. First operand 38870 states and 67585 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:37,742 INFO L93 Difference]: Finished difference Result 86564 states and 155142 transitions. [2025-02-05 17:09:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:37,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:37,951 INFO L225 Difference]: With dead ends: 86564 [2025-02-05 17:09:37,951 INFO L226 Difference]: Without dead ends: 49835 [2025-02-05 17:09:38,048 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:09:38,049 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4785 mSDsluCounter, 8676 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4805 SdHoareTripleChecker+Valid, 13091 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:38,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4805 Valid, 13091 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49835 states. [2025-02-05 17:09:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49835 to 38870. [2025-02-05 17:09:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6652579582875962) internal successors, (60682), 37109 states have internal predecessors, (60682), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:09:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67520 transitions. [2025-02-05 17:09:39,897 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67520 transitions. Word has length 179 [2025-02-05 17:09:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:39,897 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67520 transitions. [2025-02-05 17:09:39,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:09:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67520 transitions. [2025-02-05 17:09:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:09:39,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:39,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:39,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:09:39,907 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:39,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 611057415, now seen corresponding path program 1 times [2025-02-05 17:09:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266195131] [2025-02-05 17:09:39,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:39,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:09:39,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:09:39,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:39,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:39,993 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:09:39,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:39,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266195131] [2025-02-05 17:09:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266195131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:39,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072422703] [2025-02-05 17:09:39,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:39,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:39,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:39,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:39,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:39,994 INFO L87 Difference]: Start difference. First operand 38870 states and 67520 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:09:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:42,791 INFO L93 Difference]: Finished difference Result 128758 states and 230926 transitions. [2025-02-05 17:09:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:42,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:09:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:43,129 INFO L225 Difference]: With dead ends: 128758 [2025-02-05 17:09:43,130 INFO L226 Difference]: Without dead ends: 92029 [2025-02-05 17:09:43,236 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:09:43,236 INFO L435 NwaCegarLoop]: 4752 mSDtfsCounter, 5450 mSDsluCounter, 14334 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5483 SdHoareTripleChecker+Valid, 19086 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:43,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5483 Valid, 19086 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:09:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92029 states.