./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24feb2eb47843fcae857e84ddd5aa58dae94843db909f56f0ca240268764bef9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:04:19,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:04:19,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:04:19,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:04:19,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:04:19,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:04:19,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:04:19,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:04:19,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:04:19,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:04:19,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:04:19,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:04:19,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:04:19,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:04:19,691 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:04:19,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:04:19,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:04:19,691 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:04:19,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:04:19,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:04:19,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:19,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:04:19,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:04:19,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:04:19,693 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24feb2eb47843fcae857e84ddd5aa58dae94843db909f56f0ca240268764bef9 [2025-03-16 20:04:19,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:04:19,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:04:19,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:04:19,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:04:19,949 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:04:19,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c [2025-03-16 20:04:21,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834387b17/557ae9e017bc4565911e166202b6aedb/FLAG62ae6cd9a [2025-03-16 20:04:21,573 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:04:21,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c [2025-03-16 20:04:21,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834387b17/557ae9e017bc4565911e166202b6aedb/FLAG62ae6cd9a [2025-03-16 20:04:21,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834387b17/557ae9e017bc4565911e166202b6aedb [2025-03-16 20:04:21,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:04:21,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:04:21,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:21,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:04:21,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:04:21,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:21" (1/1) ... [2025-03-16 20:04:21,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1692050f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:21, skipping insertion in model container [2025-03-16 20:04:21,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:21" (1/1) ... [2025-03-16 20:04:21,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:04:22,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[382357,382370] [2025-03-16 20:04:22,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[383339,383352] [2025-03-16 20:04:23,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:23,068 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:04:23,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[382357,382370] [2025-03-16 20:04:23,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[383339,383352] [2025-03-16 20:04:23,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:23,641 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:04:23,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23 WrapperNode [2025-03-16 20:04:23,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:23,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:23,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:04:23,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:04:23,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:23,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,073 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-03-16 20:04:24,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:24,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:04:24,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:04:24,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:04:24,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,190 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:04:24,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:04:24,416 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:04:24,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:04:24,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:04:24,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (1/1) ... [2025-03-16 20:04:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:24,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:04:24,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:04:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:04:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:04:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:04:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:04:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:04:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:04:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:04:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:04:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:04:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:04:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:04:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:04:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:04:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:04:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:04:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:04:24,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:04:24,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:04:30,214 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:04:30,215 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:04:30,215 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:04:30,215 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:04:30,215 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:04:30,215 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:04:30,215 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:04:30,491 INFO L? ?]: Removed 1730 outVars from TransFormulas that were not future-live. [2025-03-16 20:04:30,492 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:04:30,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:04:30,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:04:30,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:30 BoogieIcfgContainer [2025-03-16 20:04:30,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:04:30,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:04:30,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:04:30,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:04:30,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:04:21" (1/3) ... [2025-03-16 20:04:30,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558f220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:30, skipping insertion in model container [2025-03-16 20:04:30,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:23" (2/3) ... [2025-03-16 20:04:30,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558f220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:30, skipping insertion in model container [2025-03-16 20:04:30,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:30" (3/3) ... [2025-03-16 20:04:30,555 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.10.cil-2.c [2025-03-16 20:04:30,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:04:30,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.10.cil-2.c that has 7 procedures, 2436 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-03-16 20:04:30,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:04:30,666 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;@5aa91947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:04:30,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:04:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 2436 states, 2404 states have (on average 1.8668885191347753) internal successors, (4488), 2406 states have internal predecessors, (4488), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:04:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:30,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:30,690 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] [2025-03-16 20:04:30,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1422575049, now seen corresponding path program 1 times [2025-03-16 20:04:30,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:30,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672707221] [2025-03-16 20:04:30,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:30,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:30,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:30,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672707221] [2025-03-16 20:04:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672707221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:04:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176037352] [2025-03-16 20:04:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:31,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:31,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:31,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:31,053 INFO L87 Difference]: Start difference. First operand has 2436 states, 2404 states have (on average 1.8668885191347753) internal successors, (4488), 2406 states have internal predecessors, (4488), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:31,212 INFO L93 Difference]: Finished difference Result 4869 states and 9064 transitions. [2025-03-16 20:04:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:31,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:31,240 INFO L225 Difference]: With dead ends: 4869 [2025-03-16 20:04:31,240 INFO L226 Difference]: Without dead ends: 2431 [2025-03-16 20:04:31,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:31,251 INFO L435 NwaCegarLoop]: 4460 mSDtfsCounter, 495 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 8421 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:31,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 8421 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-16 20:04:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2431. [2025-03-16 20:04:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2399 states have (on average 1.8361817423926636) internal successors, (4405), 2401 states have internal predecessors, (4405), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:04:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4453 transitions. [2025-03-16 20:04:31,382 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4453 transitions. Word has length 141 [2025-03-16 20:04:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:31,384 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4453 transitions. [2025-03-16 20:04:31,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4453 transitions. [2025-03-16 20:04:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:31,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:31,388 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] [2025-03-16 20:04:31,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:04:31,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:31,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:31,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1533628824, now seen corresponding path program 1 times [2025-03-16 20:04:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265214410] [2025-03-16 20:04:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:31,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:31,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:31,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:31,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:31,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:31,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265214410] [2025-03-16 20:04:31,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265214410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:31,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:31,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:04:31,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284841009] [2025-03-16 20:04:31,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:31,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:31,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:31,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:31,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:31,510 INFO L87 Difference]: Start difference. First operand 2431 states and 4453 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:31,561 INFO L93 Difference]: Finished difference Result 2728 states and 4925 transitions. [2025-03-16 20:04:31,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:31,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:31,571 INFO L225 Difference]: With dead ends: 2728 [2025-03-16 20:04:31,572 INFO L226 Difference]: Without dead ends: 2431 [2025-03-16 20:04:31,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:04:31,574 INFO L435 NwaCegarLoop]: 4451 mSDtfsCounter, 482 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 8408 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:31,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 8408 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-03-16 20:04:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2431. [2025-03-16 20:04:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2399 states have (on average 1.8357649020425177) internal successors, (4404), 2401 states have internal predecessors, (4404), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 20:04:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4452 transitions. [2025-03-16 20:04:31,638 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4452 transitions. Word has length 141 [2025-03-16 20:04:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:31,639 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4452 transitions. [2025-03-16 20:04:31,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4452 transitions. [2025-03-16 20:04:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:31,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:31,643 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] [2025-03-16 20:04:31,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:04:31,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:31,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1748457977, now seen corresponding path program 1 times [2025-03-16 20:04:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687378158] [2025-03-16 20:04:31,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:31,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:31,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687378158] [2025-03-16 20:04:31,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687378158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:31,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440834527] [2025-03-16 20:04:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:31,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:31,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:31,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:31,886 INFO L87 Difference]: Start difference. First operand 2431 states and 4452 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:32,483 INFO L93 Difference]: Finished difference Result 3060 states and 5469 transitions. [2025-03-16 20:04:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:04:32,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:32,495 INFO L225 Difference]: With dead ends: 3060 [2025-03-16 20:04:32,495 INFO L226 Difference]: Without dead ends: 2766 [2025-03-16 20:04:32,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:32,499 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4901 mSDsluCounter, 8906 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 13253 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:32,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 13253 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2025-03-16 20:04:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2741. [2025-03-16 20:04:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2683 states have (on average 1.8128960119269475) internal successors, (4864), 2686 states have internal predecessors, (4864), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-03-16 20:04:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4951 transitions. [2025-03-16 20:04:32,585 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4951 transitions. Word has length 141 [2025-03-16 20:04:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:32,585 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4951 transitions. [2025-03-16 20:04:32,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4951 transitions. [2025-03-16 20:04:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:32,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:32,588 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] [2025-03-16 20:04:32,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:04:32,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:32,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1424230120, now seen corresponding path program 1 times [2025-03-16 20:04:32,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:32,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949858538] [2025-03-16 20:04:32,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:32,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:32,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:32,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:32,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:32,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:32,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949858538] [2025-03-16 20:04:32,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949858538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:32,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:32,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859264468] [2025-03-16 20:04:32,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:32,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:32,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:32,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:32,802 INFO L87 Difference]: Start difference. First operand 2741 states and 4951 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:33,166 INFO L93 Difference]: Finished difference Result 3411 states and 6047 transitions. [2025-03-16 20:04:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:33,178 INFO L225 Difference]: With dead ends: 3411 [2025-03-16 20:04:33,178 INFO L226 Difference]: Without dead ends: 2807 [2025-03-16 20:04:33,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:33,182 INFO L435 NwaCegarLoop]: 4337 mSDtfsCounter, 4625 mSDsluCounter, 8539 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4643 SdHoareTripleChecker+Valid, 12876 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:33,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4643 Valid, 12876 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2025-03-16 20:04:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2741. [2025-03-16 20:04:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2683 states have (on average 1.812150577711517) internal successors, (4862), 2686 states have internal predecessors, (4862), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-03-16 20:04:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4949 transitions. [2025-03-16 20:04:33,267 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4949 transitions. Word has length 141 [2025-03-16 20:04:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:33,267 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4949 transitions. [2025-03-16 20:04:33,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4949 transitions. [2025-03-16 20:04:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:33,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:33,269 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] [2025-03-16 20:04:33,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:04:33,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash 967277081, now seen corresponding path program 1 times [2025-03-16 20:04:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877685361] [2025-03-16 20:04:33,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:33,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:33,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:33,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:33,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877685361] [2025-03-16 20:04:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877685361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:33,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:33,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:33,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121242043] [2025-03-16 20:04:33,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:33,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:33,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:33,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:33,453 INFO L87 Difference]: Start difference. First operand 2741 states and 4949 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:34,163 INFO L93 Difference]: Finished difference Result 3740 states and 6572 transitions. [2025-03-16 20:04:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:34,176 INFO L225 Difference]: With dead ends: 3740 [2025-03-16 20:04:34,176 INFO L226 Difference]: Without dead ends: 3136 [2025-03-16 20:04:34,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:34,180 INFO L435 NwaCegarLoop]: 4611 mSDtfsCounter, 4899 mSDsluCounter, 13868 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4917 SdHoareTripleChecker+Valid, 18479 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:34,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4917 Valid, 18479 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-03-16 20:04:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3027. [2025-03-16 20:04:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 2943 states have (on average 1.7917091403329934) internal successors, (5273), 2947 states have internal predecessors, (5273), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-03-16 20:04:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 5401 transitions. [2025-03-16 20:04:34,273 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 5401 transitions. Word has length 141 [2025-03-16 20:04:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:34,273 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 5401 transitions. [2025-03-16 20:04:34,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 5401 transitions. [2025-03-16 20:04:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:34,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:34,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:34,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:04:34,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:34,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1726524168, now seen corresponding path program 1 times [2025-03-16 20:04:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872895398] [2025-03-16 20:04:34,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:34,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:34,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:34,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:34,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:34,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872895398] [2025-03-16 20:04:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872895398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:34,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640261524] [2025-03-16 20:04:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:34,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:34,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:34,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:34,451 INFO L87 Difference]: Start difference. First operand 3027 states and 5401 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:35,144 INFO L93 Difference]: Finished difference Result 4653 states and 8037 transitions. [2025-03-16 20:04:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:35,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:35,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:35,158 INFO L225 Difference]: With dead ends: 4653 [2025-03-16 20:04:35,159 INFO L226 Difference]: Without dead ends: 3763 [2025-03-16 20:04:35,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:35,163 INFO L435 NwaCegarLoop]: 4607 mSDtfsCounter, 4894 mSDsluCounter, 13856 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4912 SdHoareTripleChecker+Valid, 18463 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:35,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4912 Valid, 18463 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-03-16 20:04:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3638. [2025-03-16 20:04:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3638 states, 3500 states have (on average 1.7617142857142858) internal successors, (6166), 3508 states have internal predecessors, (6166), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-03-16 20:04:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 6382 transitions. [2025-03-16 20:04:35,260 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 6382 transitions. Word has length 141 [2025-03-16 20:04:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:35,261 INFO L471 AbstractCegarLoop]: Abstraction has 3638 states and 6382 transitions. [2025-03-16 20:04:35,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 6382 transitions. [2025-03-16 20:04:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:35,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:35,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:35,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:04:35,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:35,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1927356985, now seen corresponding path program 1 times [2025-03-16 20:04:35,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:35,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913028680] [2025-03-16 20:04:35,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:35,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:35,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:35,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:35,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:35,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:35,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:35,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913028680] [2025-03-16 20:04:35,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913028680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:35,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:35,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:35,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712304800] [2025-03-16 20:04:35,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:35,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:35,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:35,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:35,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:35,397 INFO L87 Difference]: Start difference. First operand 3638 states and 6382 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:36,096 INFO L93 Difference]: Finished difference Result 6630 states and 11272 transitions. [2025-03-16 20:04:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:36,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:36,119 INFO L225 Difference]: With dead ends: 6630 [2025-03-16 20:04:36,119 INFO L226 Difference]: Without dead ends: 5129 [2025-03-16 20:04:36,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:36,128 INFO L435 NwaCegarLoop]: 4604 mSDtfsCounter, 4889 mSDsluCounter, 13847 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4907 SdHoareTripleChecker+Valid, 18451 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:36,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4907 Valid, 18451 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2025-03-16 20:04:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4971. [2025-03-16 20:04:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4971 states, 4719 states have (on average 1.7279084551811825) internal successors, (8154), 4741 states have internal predecessors, (8154), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-03-16 20:04:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 8570 transitions. [2025-03-16 20:04:36,277 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 8570 transitions. Word has length 141 [2025-03-16 20:04:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:36,278 INFO L471 AbstractCegarLoop]: Abstraction has 4971 states and 8570 transitions. [2025-03-16 20:04:36,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 8570 transitions. [2025-03-16 20:04:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:36,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:36,282 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] [2025-03-16 20:04:36,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:04:36,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:36,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1141364520, now seen corresponding path program 1 times [2025-03-16 20:04:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:36,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793957231] [2025-03-16 20:04:36,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:36,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:36,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:36,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793957231] [2025-03-16 20:04:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793957231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:36,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:36,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:36,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858595744] [2025-03-16 20:04:36,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:36,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:36,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:36,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:36,416 INFO L87 Difference]: Start difference. First operand 4971 states and 8570 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:37,108 INFO L93 Difference]: Finished difference Result 11009 states and 18634 transitions. [2025-03-16 20:04:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:37,147 INFO L225 Difference]: With dead ends: 11009 [2025-03-16 20:04:37,147 INFO L226 Difference]: Without dead ends: 8175 [2025-03-16 20:04:37,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:37,163 INFO L435 NwaCegarLoop]: 4601 mSDtfsCounter, 4884 mSDsluCounter, 13838 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4902 SdHoareTripleChecker+Valid, 18439 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:37,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4902 Valid, 18439 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2025-03-16 20:04:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 7952. [2025-03-16 20:04:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7952 states, 7454 states have (on average 1.7040515159645828) internal successors, (12702), 7522 states have internal predecessors, (12702), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-03-16 20:04:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7952 states to 7952 states and 13614 transitions. [2025-03-16 20:04:37,401 INFO L78 Accepts]: Start accepts. Automaton has 7952 states and 13614 transitions. Word has length 141 [2025-03-16 20:04:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:37,401 INFO L471 AbstractCegarLoop]: Abstraction has 7952 states and 13614 transitions. [2025-03-16 20:04:37,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7952 states and 13614 transitions. [2025-03-16 20:04:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:37,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:37,406 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] [2025-03-16 20:04:37,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:04:37,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:37,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash 145117785, now seen corresponding path program 1 times [2025-03-16 20:04:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707574464] [2025-03-16 20:04:37,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:37,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:37,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:37,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:37,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:37,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:37,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707574464] [2025-03-16 20:04:37,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707574464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:37,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:37,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:37,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046987697] [2025-03-16 20:04:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:37,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:37,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:37,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:37,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:37,539 INFO L87 Difference]: Start difference. First operand 7952 states and 13614 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:38,359 INFO L93 Difference]: Finished difference Result 20968 states and 36012 transitions. [2025-03-16 20:04:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:38,407 INFO L225 Difference]: With dead ends: 20968 [2025-03-16 20:04:38,407 INFO L226 Difference]: Without dead ends: 15153 [2025-03-16 20:04:38,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:38,431 INFO L435 NwaCegarLoop]: 4598 mSDtfsCounter, 4879 mSDsluCounter, 13829 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4897 SdHoareTripleChecker+Valid, 18427 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:38,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4897 Valid, 18427 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15153 states. [2025-03-16 20:04:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15153 to 14805. [2025-03-16 20:04:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14805 states, 13761 states have (on average 1.7011845069399025) internal successors, (23410), 13975 states have internal predecessors, (23410), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-16 20:04:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 25698 transitions. [2025-03-16 20:04:38,954 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 25698 transitions. Word has length 141 [2025-03-16 20:04:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:38,954 INFO L471 AbstractCegarLoop]: Abstraction has 14805 states and 25698 transitions. [2025-03-16 20:04:38,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 25698 transitions. [2025-03-16 20:04:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:38,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:38,960 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] [2025-03-16 20:04:38,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:04:38,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:38,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2126279864, now seen corresponding path program 1 times [2025-03-16 20:04:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650016350] [2025-03-16 20:04:38,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:38,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:38,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:38,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:38,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650016350] [2025-03-16 20:04:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650016350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:39,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:39,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:39,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345680647] [2025-03-16 20:04:39,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:39,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:39,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:39,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:39,055 INFO L87 Difference]: Start difference. First operand 14805 states and 25698 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:39,559 INFO L93 Difference]: Finished difference Result 31393 states and 55608 transitions. [2025-03-16 20:04:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:39,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:39,621 INFO L225 Difference]: With dead ends: 31393 [2025-03-16 20:04:39,622 INFO L226 Difference]: Without dead ends: 18725 [2025-03-16 20:04:39,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:39,658 INFO L435 NwaCegarLoop]: 4324 mSDtfsCounter, 4617 mSDsluCounter, 8514 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 12838 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:39,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 12838 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18725 states. [2025-03-16 20:04:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18725 to 14805. [2025-03-16 20:04:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14805 states, 13761 states have (on average 1.6987864254051304) internal successors, (23377), 13975 states have internal predecessors, (23377), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-16 20:04:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 25665 transitions. [2025-03-16 20:04:40,372 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 25665 transitions. Word has length 141 [2025-03-16 20:04:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:40,372 INFO L471 AbstractCegarLoop]: Abstraction has 14805 states and 25665 transitions. [2025-03-16 20:04:40,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 25665 transitions. [2025-03-16 20:04:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:40,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:40,379 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] [2025-03-16 20:04:40,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:04:40,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:40,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash 943262329, now seen corresponding path program 1 times [2025-03-16 20:04:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035373626] [2025-03-16 20:04:40,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:40,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:40,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:40,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:40,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035373626] [2025-03-16 20:04:40,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035373626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:40,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:40,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596368285] [2025-03-16 20:04:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:40,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:40,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:40,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:40,493 INFO L87 Difference]: Start difference. First operand 14805 states and 25665 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:41,145 INFO L93 Difference]: Finished difference Result 31148 states and 55052 transitions. [2025-03-16 20:04:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:41,210 INFO L225 Difference]: With dead ends: 31148 [2025-03-16 20:04:41,210 INFO L226 Difference]: Without dead ends: 18480 [2025-03-16 20:04:41,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:41,244 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4641 mSDsluCounter, 8480 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 12772 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:41,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 12772 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18480 states. [2025-03-16 20:04:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18480 to 14805. [2025-03-16 20:04:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14805 states, 13761 states have (on average 1.6963883438703582) internal successors, (23344), 13975 states have internal predecessors, (23344), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-16 20:04:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 25632 transitions. [2025-03-16 20:04:41,825 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 25632 transitions. Word has length 141 [2025-03-16 20:04:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:41,825 INFO L471 AbstractCegarLoop]: Abstraction has 14805 states and 25632 transitions. [2025-03-16 20:04:41,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 25632 transitions. [2025-03-16 20:04:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:41,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:41,831 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] [2025-03-16 20:04:41,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:04:41,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:41,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash -203278184, now seen corresponding path program 1 times [2025-03-16 20:04:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:41,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740971705] [2025-03-16 20:04:41,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:41,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:41,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:41,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:41,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:41,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740971705] [2025-03-16 20:04:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740971705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:41,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:41,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356402532] [2025-03-16 20:04:41,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:41,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:41,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:41,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:41,949 INFO L87 Difference]: Start difference. First operand 14805 states and 25632 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:43,049 INFO L93 Difference]: Finished difference Result 43719 states and 77484 transitions. [2025-03-16 20:04:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:43,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:43,164 INFO L225 Difference]: With dead ends: 43719 [2025-03-16 20:04:43,164 INFO L226 Difference]: Without dead ends: 31051 [2025-03-16 20:04:43,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:43,208 INFO L435 NwaCegarLoop]: 4585 mSDtfsCounter, 4858 mSDsluCounter, 13792 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4876 SdHoareTripleChecker+Valid, 18377 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:43,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4876 Valid, 18377 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31051 states. [2025-03-16 20:04:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31051 to 30536. [2025-03-16 20:04:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30536 states, 28238 states have (on average 1.7084779375309866) internal successors, (48244), 28906 states have internal predecessors, (48244), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-03-16 20:04:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30536 states to 30536 states and 54820 transitions. [2025-03-16 20:04:44,270 INFO L78 Accepts]: Start accepts. Automaton has 30536 states and 54820 transitions. Word has length 141 [2025-03-16 20:04:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:44,271 INFO L471 AbstractCegarLoop]: Abstraction has 30536 states and 54820 transitions. [2025-03-16 20:04:44,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 30536 states and 54820 transitions. [2025-03-16 20:04:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:44,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:44,282 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] [2025-03-16 20:04:44,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:04:44,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:44,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1487189351, now seen corresponding path program 1 times [2025-03-16 20:04:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220890268] [2025-03-16 20:04:44,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:44,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:44,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:44,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:44,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:44,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220890268] [2025-03-16 20:04:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220890268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:44,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:44,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964079607] [2025-03-16 20:04:44,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:44,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:44,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:44,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:44,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:44,385 INFO L87 Difference]: Start difference. First operand 30536 states and 54820 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:45,838 INFO L93 Difference]: Finished difference Result 68438 states and 126696 transitions. [2025-03-16 20:04:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:45,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:46,011 INFO L225 Difference]: With dead ends: 68438 [2025-03-16 20:04:46,011 INFO L226 Difference]: Without dead ends: 40039 [2025-03-16 20:04:46,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:46,103 INFO L435 NwaCegarLoop]: 4316 mSDtfsCounter, 4610 mSDsluCounter, 8500 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4628 SdHoareTripleChecker+Valid, 12816 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:46,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4628 Valid, 12816 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40039 states. [2025-03-16 20:04:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40039 to 30536. [2025-03-16 20:04:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30536 states, 28238 states have (on average 1.7061760747928323) internal successors, (48179), 28906 states have internal predecessors, (48179), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-03-16 20:04:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30536 states to 30536 states and 54755 transitions. [2025-03-16 20:04:47,604 INFO L78 Accepts]: Start accepts. Automaton has 30536 states and 54755 transitions. Word has length 141 [2025-03-16 20:04:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:47,604 INFO L471 AbstractCegarLoop]: Abstraction has 30536 states and 54755 transitions. [2025-03-16 20:04:47,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30536 states and 54755 transitions. [2025-03-16 20:04:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:47,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:47,613 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] [2025-03-16 20:04:47,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:04:47,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:47,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1251511176, now seen corresponding path program 1 times [2025-03-16 20:04:47,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:47,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740069044] [2025-03-16 20:04:47,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:47,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:47,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:47,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740069044] [2025-03-16 20:04:47,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740069044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:47,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:47,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627845527] [2025-03-16 20:04:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:47,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:47,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:47,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:47,709 INFO L87 Difference]: Start difference. First operand 30536 states and 54755 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:50,350 INFO L93 Difference]: Finished difference Result 100668 states and 187484 transitions. [2025-03-16 20:04:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:50,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:50,708 INFO L225 Difference]: With dead ends: 100668 [2025-03-16 20:04:50,708 INFO L226 Difference]: Without dead ends: 72269 [2025-03-16 20:04:50,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:04:50,823 INFO L435 NwaCegarLoop]: 4575 mSDtfsCounter, 5126 mSDsluCounter, 13758 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5155 SdHoareTripleChecker+Valid, 18333 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:50,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5155 Valid, 18333 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72269 states. [2025-03-16 20:04:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72269 to 67152. [2025-03-16 20:04:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67152 states, 61924 states have (on average 1.7277469155739293) internal successors, (106989), 63986 states have internal predecessors, (106989), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-03-16 20:04:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67152 states to 67152 states and 128157 transitions. [2025-03-16 20:04:53,862 INFO L78 Accepts]: Start accepts. Automaton has 67152 states and 128157 transitions. Word has length 141 [2025-03-16 20:04:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:53,862 INFO L471 AbstractCegarLoop]: Abstraction has 67152 states and 128157 transitions. [2025-03-16 20:04:53,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67152 states and 128157 transitions. [2025-03-16 20:04:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:04:53,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:53,880 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] [2025-03-16 20:04:53,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:04:53,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2075192647, now seen corresponding path program 1 times [2025-03-16 20:04:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:53,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915598561] [2025-03-16 20:04:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:53,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:04:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:04:53,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:04:53,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:53,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915598561] [2025-03-16 20:04:53,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915598561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:53,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:53,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:53,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906562653] [2025-03-16 20:04:53,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:53,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:53,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:53,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:53,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:53,956 INFO L87 Difference]: Start difference. First operand 67152 states and 128157 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:57,234 INFO L93 Difference]: Finished difference Result 156246 states and 310564 transitions. [2025-03-16 20:04:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:57,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:04:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:57,607 INFO L225 Difference]: With dead ends: 156246 [2025-03-16 20:04:57,607 INFO L226 Difference]: Without dead ends: 91231 [2025-03-16 20:04:57,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:57,792 INFO L435 NwaCegarLoop]: 4311 mSDtfsCounter, 4604 mSDsluCounter, 8489 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4622 SdHoareTripleChecker+Valid, 12800 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:57,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4622 Valid, 12800 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:04:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91231 states. [2025-03-16 20:05:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91231 to 67152. [2025-03-16 20:05:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67152 states, 61924 states have (on average 1.7256637168141593) internal successors, (106860), 63986 states have internal predecessors, (106860), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-03-16 20:05:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67152 states to 67152 states and 128028 transitions. [2025-03-16 20:05:01,726 INFO L78 Accepts]: Start accepts. Automaton has 67152 states and 128028 transitions. Word has length 141 [2025-03-16 20:05:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:01,727 INFO L471 AbstractCegarLoop]: Abstraction has 67152 states and 128028 transitions. [2025-03-16 20:05:01,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 67152 states and 128028 transitions. [2025-03-16 20:05:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:05:01,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:01,748 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] [2025-03-16 20:05:01,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:05:01,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash -993384360, now seen corresponding path program 1 times [2025-03-16 20:05:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949353329] [2025-03-16 20:05:01,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:01,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:05:01,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:05:01,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:01,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:05:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949353329] [2025-03-16 20:05:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949353329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:05:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866895358] [2025-03-16 20:05:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:01,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:05:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:01,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:05:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:05:01,840 INFO L87 Difference]: Start difference. First operand 67152 states and 128028 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:07,058 INFO L93 Difference]: Finished difference Result 226704 states and 458985 transitions. [2025-03-16 20:05:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:05:07,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2025-03-16 20:05:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:08,048 INFO L225 Difference]: With dead ends: 226704 [2025-03-16 20:05:08,049 INFO L226 Difference]: Without dead ends: 161689 [2025-03-16 20:05:08,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:05:08,366 INFO L435 NwaCegarLoop]: 4567 mSDtfsCounter, 5059 mSDsluCounter, 13735 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5088 SdHoareTripleChecker+Valid, 18302 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:08,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5088 Valid, 18302 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:05:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161689 states. [2025-03-16 20:05:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161689 to 153314. [2025-03-16 20:05:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153314 states, 140832 states have (on average 1.7469751192910703) internal successors, (246030), 147140 states have internal predecessors, (246030), 4632 states have call successors, (4632), 1542 states have call predecessors, (4632), 7848 states have return successors, (70168), 4887 states have call predecessors, (70168), 4632 states have call successors, (70168) [2025-03-16 20:05:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153314 states to 153314 states and 320830 transitions. [2025-03-16 20:05:17,861 INFO L78 Accepts]: Start accepts. Automaton has 153314 states and 320830 transitions. Word has length 141 [2025-03-16 20:05:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:17,862 INFO L471 AbstractCegarLoop]: Abstraction has 153314 states and 320830 transitions. [2025-03-16 20:05:17,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 153314 states and 320830 transitions. [2025-03-16 20:05:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 20:05:17,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:17,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:05:17,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:05:17,898 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:17,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1512676647, now seen corresponding path program 1 times [2025-03-16 20:05:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:17,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334051921] [2025-03-16 20:05:17,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:17,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 20:05:17,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 20:05:17,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:17,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:17,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-03-16 20:05:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:17,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334051921] [2025-03-16 20:05:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334051921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:17,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:05:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018085198] [2025-03-16 20:05:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:17,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:05:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:17,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:05:17,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:05:17,995 INFO L87 Difference]: Start difference. First operand 153314 states and 320830 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)